@conference {18578,
	title = {Joint analysis of network incidents and intradomain routing changes},
	booktitle = {Network and Service Management (CNSM), 2010 International Conference on},
	year = {2010},
	month = {2010/10//},
	pages = {198 - 205},
	abstract = {This paper studies how intradomain routing instability relates to events in network trouble tickets for two networks: a VPN provider and the Internet2 backbone network. Our goal in performing this joint analysis of routing and trouble tickets is to better understand the likely underlying causes of intradomain routing instability. We develop a method to correlate trouble tickets with instability events and find that, although unplanned events last longer than scheduled maintenance, there is no single underlying cause for most instability, and that these causes differ across networks. In comparison to a similar study from Labovitz et al. from ten years ago, we find that, while certain causes of instability such as maintenance and circuit problems remain significant, power issues have become much less prevalent, and software-related problems have become more common.},
	keywords = {correlation method, Internet, Internet2 backbone network, intradomain routing instability, network maintenance, network routing joint analysis, telecommunication network routing, Virtual private networks, VPN provider},
	doi = {10.1109/CNSM.2010.5691306},
	author = {Medem,A. and Teixeira,R. and Feamster, Nick and Meulle,M.}
}
@conference {13264,
	title = {A Java3D framework for inspecting and segmenting 3D models},
	booktitle = {Proceedings of the 13th international symposium on 3D web technology},
	series = {Web3D {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {67 - 74},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Models of 3D objects have become widely accessible in several disciplines within academia and industry, spanning from scientific visualization to entertainment. In the last few years, 3D models are often organized into digital libraries accessible over the network, and thus semantic annotation of such models becomes an important issue. A fundamental step in annotating a 3D model is to segment it into meaningful parts. In this work, we present a Java3D framework for inspecting and segmenting 3D objects represented in X3D format. In particular, we present a combination of segmentation and merging techniques for producing a feasible decomposition of the boundary of a 3D object. We represent such decomposition as a graph, that we call the segmentation graph which is the basis for semantic annotation. We describe also the interface we have developed to allow visualization and browsing of both the decomposition and the segmentation graph in order to understand the topological structure of the resulting decomposition.},
	keywords = {Java3D, object manipulation, Object segmentation, shape semantics, X3D},
	isbn = {978-1-60558-213-9},
	doi = {10.1145/1394209.1394225},
	url = {http://doi.acm.org/10.1145/1394209.1394225},
	author = {De Floriani, Leila and Papaleo,Laura and Carissimi,Nicol{\'o}}
}
@article {12575,
	title = {Jmin-image based color-texture segmentation using watershed and hierarchical clustering},
	journal = {Proceedings of the 8th International Symposium on Mathematical Morphology},
	volume = {2},
	year = {2007},
	month = {2007/10//undefin},
	pages = {35 - 36},
	author = {Santos, T.T. and Morimoto, CH and Chellapa, Rama}
}
@conference {12595,
	title = {Joint Acoustic-Video Fingerprinting of Vehicles, Part I},
	booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on},
	volume = {2},
	year = {2007},
	month = {2007/04//},
	pages = {II-745 -II-748 - II-745 -II-748},
	abstract = {We address vehicle classification and measurement problems using acoustic and video sensors. In this paper, we show how to estimate a vehicle{\textquoteright}s speed, width, and length by jointly estimating its acoustic wave-pattern using a single passive sensor that records the vehicle{\textquoteright}s drive-by noise. The acoustic wave-pattern is approximated using three envelope shape (ES) components, which approximate the shape of the received signal{\textquoteright}s power envelope. We incorporate the parameters of the ES components along with the estimates of the vehicle engine RPM and number of cylinders to create a vehicle profile vector that forms an intuitive discriminatory feature space. In the companion paper, we discuss vehicle classification and mensuration based on silhouette extraction and wheel detection, using a video sensor. Vehicle speed estimation and classification results are provided using field data.},
	keywords = {acoustic, acoustic-video, components;joint, detection;acoustic, estimation;video, fingerprinting;passive, processing;, processing;acoustic, sensor;vehicle, sensors;acoustic, sensors;wheel, SHAPE, signal, speed, transducers;video, wave-pattern;envelope},
	doi = {10.1109/ICASSP.2007.366343},
	author = {Cevher, V. and Chellapa, Rama and McClellan, J.H.}
}
@conference {12594,
	title = {Joint Acoustic-Video Fingerprinting of Vehicles, Part II},
	booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on},
	volume = {2},
	year = {2007},
	month = {2007/04//},
	pages = {II-749 -II-752 - II-749 -II-752},
	abstract = {In this second paper, we first show how to estimate the wheelbase length of a vehicle using line metrology in video. We then address the vehicle fingerprinting problem using vehicle silhouettes and color invariants. We combine the acoustic metrology and classification results discussed in Part I with the video results to improve estimation performance and robustness. The acoustic video fusion is achieved in a Bayesian framework by assuming conditional independence of the observations of each modality. For the metrology density functions, Laplacian approximations are used for computational efficiency. Experimental results are given using field data},
	keywords = {acoustic-video, analysis;video, approximations;acoustic, Bayesian, colour, density, efficiency;joint, estimation;Bayes, fingerprinting;metrology, framework;Laplacian, functions;performance, fusion;color, identification;image, invariants;computational, methods;acoustic, metrology;acoustic, processing;, processing;fingerprint, signal, video},
	doi = {10.1109/ICASSP.2007.366344},
	author = {Cevher, V. and Guo, F. and Sankaranarayanan,A. C and Chellapa, Rama}
}
@article {18236,
	title = {Joint Uplink and Downlink Optimization for Real-Time Multiuser Video Streaming Over WLANs},
	journal = {Selected Topics in Signal Processing, IEEE Journal of},
	volume = {1},
	year = {2007},
	month = {2007/08//},
	pages = {280 - 294},
	abstract = {In this paper, a network-aware and source-aware video streaming system is proposed to support interactive multiuser communications within single-cell and multicell IEEE 802.11 networks. Unlike the traditional streaming video services, the strict delay constraints of an interactive video streaming system pose more challenges. These challenges include the heterogeneity of uplink and downlink channel conditions experienced by different users, the multiuser resource allocation of limited radio resources, the incorporation of the cross-layer design, and the diversity of content complexities exhibited by different video sequences. With the awareness of video content and network resources, the proposed system integrates cross-layer error protection mechanism and performs dynamic resource allocation across multiple users. We formulate the proposed system as to minimize the maximal end-to-end expected distortion received by all users, subject to maximal transmission power and delay constraints. To reduce the high dimensionality of the search space, fast multiuser algorithms are proposed to find the near-optimal solutions. Compared to the strategy without dynamically and jointly allocating bandwidth resource for uplinks and downlinks, the proposed framework outperforms by 2.18 7.95 dB in terms of the average received PSNR of all users and by 3.82 11.50 dB in terms of the lowest received PSNR among all users. Furthermore, the proposed scheme can provide more uniform video quality for all users and lower quality fluctuation for each received video sequence.},
	keywords = {802.11, allocation;image, allocation;real-time, communications;maximal, distortion;multiuser, end-to-end, error, expected, IEEE, LAN;, mechanism;downlink, multiuser, networks;WLAN;cross-layer, optimization;interactive, optimization;video, Protection, quality;video, resource, sequences;video, streaming, streaming;uplink, streaming;wireless, system;bandwidth, video},
	isbn = {1932-4553},
	doi = {10.1109/JSTSP.2007.901518},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@conference {16424,
	title = {Just a cog in the machine: participatory robotics as a tool for understanding collaborative learning and decision-making},
	booktitle = {Proceedings of the 8th iternational conference on Computer supported collaborative learning},
	series = {CSCL{\textquoteright}07},
	year = {2007},
	month = {2007///},
	pages = {84 - 86},
	publisher = {International Society of the Learning Sciences},
	organization = {International Society of the Learning Sciences},
	abstract = {We will demonstrate the integration of a software-based multi-agent modeling platform with a participatory simulation environment and a real-time control system for a physical robotic agent. Both real and virtual participants will be able to act collaboratively in a simulation that will control a physical agent. The backbone of this demonstration is a widely used, freely available, mature modeling platform (NetLogo). We posit that this technological platform can be of use for researchers interested in investigating collaborative learning and decision-making, as well as to design collaborative learning activities. We will present preliminary findings from pilot studies with the tool.},
	isbn = {978-0-6151-5436-7},
	url = {http://dl.acm.org/citation.cfm?id=1599600.1599614},
	author = {Blikstein,Paulo and Rand, William and Wilensky,Uri}
}
@article {18231,
	title = {JET: dynamic join-exit-tree amortization and scheduling for contributory key management},
	journal = {IEEE/ACM Trans. Netw.},
	volume = {14},
	year = {2006},
	month = {2006/10//},
	pages = {1128 - 1140},
	abstract = {In secure group communications, the time cost associated with key updates in the events of member join and departure is an important aspect of quality of service, especially in large groups with highly dynamic membership. To achieve better time efficiency, we propose a join-exit-tree (JET) key management framework. First, a special key tree topology with join and exit subtrees is introduced to handle key updates for dynamic membership. Then, optimization techniques are employed to determine the capacities of join and exit subtrees for achieving the best time efficiency, and algorithms are designed to dynamically update the join and exit trees. We show that, on average, the asymptotic time cost for each member join/departure event is reduced to O(log (log n)) from the previous cost of O(log n), where n is the group size. Our experimental results based on simulated user activities as well as the real MBone data demonstrate that the proposed JET scheme can significantly improve the time efficiency, while maintaining low communication and computation cost, of tree-based contributory key management.},
	keywords = {contributory key management, dynamic tree topology, secure group communications, time efficiency},
	isbn = {1063-6692},
	doi = {10.1109/TNET.2006.882851},
	url = {http://dx.doi.org/10.1109/TNET.2006.882851},
	author = {Mao,Yinian and Sun,Yan and M. Wu and Liu,K. J.R}
}
@article {18233,
	title = {Joint coding and embedding techniques for MultimediaFingerprinting},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {1},
	year = {2006},
	month = {2006/06//},
	pages = {231 - 247},
	abstract = {Digital fingerprinting protects multimedia content from illegal redistribution by uniquely marking every copy of the content distributed to each user. The collusion attack is a powerful attack where several different fingerprinted copies of the same content are combined together to attenuate or even remove the fingerprints. One major category of collusion-resistant fingerprinting employs an explicit step of coding. Most existing works on coded fingerprinting mainly focus on the code-level issues and treat the embedding issues through abstract assumptions without examining the overall performance. In this paper, we jointly consider the coding and embedding issues for coded fingerprinting systems and examine their performance in terms of collusion resistance, detection computational complexity, and distribution efficiency. Our studies show that coded fingerprinting has efficient detection but rather low collusion resistance. Taking advantage of joint coding and embedding, we propose a permuted subsegment embedding technique and a group-based joint coding and embedding technique to improve the collusion resistance of coded fingerprinting while maintaining its efficient detection. Experimental results show that the number of colluders that the proposed methods can resist is more than three times as many as that of the conventional coded fingerprinting approaches.},
	keywords = {coding-embedding, coding;, collusion-resistant, complexity;, computational, data;, DETECTION, embedded, EMBEDDING, fingerprinting;, group-based, image, joint, multimedia, of, Security, subsegment, systems;, technique;, techniques;},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2006.873597},
	author = {He,Shan and M. Wu}
}
@article {18153,
	title = {A joint signal processing and cryptographic approach to multimedia encryption},
	journal = {Image Processing, IEEE Transactions on},
	volume = {15},
	year = {2006},
	month = {2006/07//},
	pages = {2061 - 2075},
	abstract = {In recent years, there has been an increasing trend for multimedia applications to use delegate service providers for content distribution, archiving, search, and retrieval. These delegate services have brought new challenges to the protection of multimedia content confidentiality. This paper discusses the importance and feasibility of applying a joint signal processing and cryptographic approach to multimedia encryption, in order to address the access control issues unique to multimedia applications. We propose two atomic encryption operations that can preserve standard compliance and are friendly to delegate processing. Quantitative analysis for these operations is presented to demonstrate that a good tradeoff can be made between security and bitrate overhead. In assisting the design and evaluation of media security systems, we also propose a set of multimedia-oriented security scores to quantify the security against approximation attacks and to complement the existing notion of generic data security. Using video as an example, we present a systematic study on how to strategically integrate different atomic operations to build a video encryption system. The resulting system can provide superior performance over both generic encryption and its simple adaptation to video in terms of a joint consideration of security, bitrate overhead, and friendliness to delegate processing.},
	keywords = {access control;approximation attacks;atomic encryption operations;bitrate overhead;content distribution;cryptographic approach;delegate processing;delegate service providers;generic data security;media security systems;multimedia content confidentiality;m, Computer-Assisted;, Computer-Assisted;Information Storage and Retrieval;Multimedia;Signal Processing},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2006.873426},
	author = {Mao,Yinian and M. Wu}
}
@conference {16384,
	title = {The Java memory model},
	booktitle = {Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages},
	series = {POPL {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {378 - 391},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compilers.The new Java model provides a simple interface for correctly synchronized programs -- it guarantees sequential consistency to data-race-free programs. Its novel contribution is requiring that the behavior of incorrectly synchronized programs be bounded by a well defined notion of causality. The causality requirement is strong enough to respect the safety and security properties of Java and weak enough to allow standard compiler and hardware optimizations. To our knowledge, other models are either too weak because they do not provide for sufficient safety/security, or are too strong because they rely on a strong notion of data and control dependences that precludes some standard compiler transformations.Although the majority of what is currently done in compilers is legal, the new model introduces significant differences, and clearly defines the boundaries of legal transformations. For example, the commonly accepted definition for control dependence is incorrect for Java, and transformations based on it may be invalid.In addition to providing the official memory model for Java, we believe the model described here could prove to be a useful basis for other programming languages that currently lack well-defined models, such as C++ and C$\#$.},
	keywords = {concurrency, java, memory model, Multithreading},
	isbn = {1-58113-830-X},
	doi = {10.1145/1040305.1040336},
	url = {http://doi.acm.org/10.1145/1040305.1040336},
	author = {Manson,Jeremy and Pugh, William and Adve,Sarita V.}
}
@article {13806,
	title = {Johns Hopkins summer workshop final report on parsing and spoken structural event detection},
	journal = {Johns Hopkins University, Tech. Rep},
	year = {2005},
	month = {2005///},
	abstract = {This report describes research conducted by the Parsing and Spoken Structural Event Detection(PaSSED) team as part of the 2005 Johns Hopkins Summer Workshop on Language Engineering.
This project investigated the interaction between parsing and the detection of structural metadata in
conversational speech, including sentence boundaries, edits (the reparandum portion of speech repairs),
and fillers. In terms of parsing, we explored alternative methods of exploiting metadata information in
parsing models and measured how varying accuracy in transcription and metadata information affects
parsing accuracy. In the other direction, we similarly considered how syntactic and prosodic knowledge
could be leveraged in metadata detection, measuring how this knowledge impacts metadata detection
accuracy.
As part of this work, we investigated metrics for evaluating parse accuracy in the presence of tran-
scription and metadata detection errors, and we report on our experience using these metrics with several
parsers and across varying experimental conditions. A range of methods for handling edits during pars-
ing were evaluated in this research (excision, addition of markups to the input string, and grammar
modification). We also developed a ToBI (a prosodic structure annotation scheme [SBP+92]) prosodic
event classifier and describe its evaluation. Finally, we present methods for effective n-best sentence
boundary candidate generation and reranking using syntactic, prosodic, and other features. These stud-
ies are complemented by a second set of reranking investigations wherein we optimize sentence boundary
detection explicitly to improve parse accuracy.
The PaSSED project has:
{\textbullet} investigated various techniques to enhance parsing of speech given metadata detection on conver-
sational speech;
{\textbullet} defined metrics for evaluating speech parsing accuracy, implemented them in the publically avail-
able SParseval software package, and evaluated them under a wide variety of conditions;
{\textbullet} recast SU detection as an n-best reranking problem with a relatively small n. Using this approach,
we demonstrated significant improvements over a very strong baseline SU detection system.
{\textbullet} reported on the interaction between parsing and metadata detection and their synergy;
{\textbullet} fostered new collaborations and identified a number of interesting avenues for future work.
},
	author = {Harper,MP and Dorr, Bonnie J and Hale,J. and Roark,B. and Shafran,I. and Lease,M. and Liu,Y. and Snover,M. and Yung,L. and Krasnyanskaya,A.}
}
@article {12369,
	title = {Joint application mapping/interconnect synthesis techniques for embedded chip-scale multiprocessors},
	journal = {Parallel and Distributed Systems, IEEE Transactions on},
	volume = {16},
	year = {2005},
	month = {2005///},
	pages = {99 - 112},
	author = {Bambha,N. K and Bhattacharyya, Shuvra S.}
}
@conference {18237,
	title = {Joint uplink and downlink optimization for video conferencing over wireless LAN},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/1101 - ii/1104 Vol. 2 - ii/1101 - ii/1104 Vol. 2},
	abstract = {A real-time video conferencing framework is proposed for multiple conferencing pairs by jointly considering the uplink and downlink conditions within IEEE 802.11 networks. We formulate this system so as to minimize the maximal end-to-end expected distortion received by all users by selecting the PHY modes and transmission time. Compared with the strategy of individually optimizing uplink and downlink, the proposed framework outperforms by 3.67-8.65 dB for the average received PSNR among all users.},
	keywords = {802.11, conferencing, conferencing;, distortion;, end-to-end, expected, IEEE, joint, LAN;, maximal, minimisation;, modes;, multiple, networks;, optimization;, pairs;, PHY, PSNR;, real-time, teleconferencing;, time;, transmission, uplink-downlink, video, wireless},
	doi = {10.1109/ICASSP.2005.1415601},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@conference {12367,
	title = {Java-through-c compilation: An enabling technology for java in embedded systems},
	booktitle = {Proceedings of the conference on Design, automation and test in Europe-Volume 3},
	year = {2004},
	month = {2004///},
	pages = {30161 - 30161},
	author = {Varma,A. and Bhattacharyya, Shuvra S.}
}
@article {18234,
	title = {Joint security and robustness enhancement for quantization based data embedding},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {13},
	year = {2003},
	month = {2003/08//},
	pages = {831 - 841},
	abstract = {The paper studies joint security and robustness enhancement of quantization-based data embedding for multimedia authentication applications. We present an analysis showing that through a nontrivial run lookup table (LUT) that maps quantized multimedia features randomly to binary data, the probability of detection error can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion-compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding.},
	keywords = {(signal);, authentication;, binary, compensation;, data, data;, DETECTION, digital, distortion, distortion;, embedding;, encapsulation;, enhancement;, error, features;, hiding;, lookup, lookup;, LUT;, message, multimedia, nontrivial, probability;, quantisation, quantization, quantized, Robustness, run, Security, statistics;, systems;, table, table;, watermarking;},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2003.815951},
	author = {Wu,M.}
}
@conference {18235,
	title = {Joint security robustness enhancement for quantization embedding},
	booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/09//},
	pages = {II - 483-6 vol.3 - II - 483-6 vol.3},
	abstract = {This paper studies joint security and robustness enhancement of quantization based data embedding for multimedia authentication applications. We present analysis showing that through a lookup table (LUT) of nontrivial run that maps quantized multimedia features randomly to binary data, the detection error probability can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding.},
	keywords = {applications;, Authentication, authentication;, binary, communication;, data, data;, embedding;, error, joint, lookup, lookup;, message, multimedia, probability;, security;, statistics;, table, table;, watermarking;},
	doi = {10.1109/ICIP.2003.1246722},
	author = {Wu,M.}
}
@article {18485,
	title = {Joint audio-visual tracking using particle filters},
	journal = {EURASIP J. Appl. Signal Process.},
	volume = {2002},
	year = {2002},
	month = {2002/01//},
	pages = {1154 - 1164},
	abstract = {It is often advantageous to track objects in a scene using multimodal information when such information is available. We use audio as a complementary modality to video data, which, in comparison to vision, can provide faster localization over a wider field of view. We present a particle-filter based tracking framework for performing multimodal sensor fusion for tracking people in a videoconferencing environment using multiple cameras and multiple microphone arrays. One advantage of our proposed tracker is its ability to seamlessly handle temporary absence of some measurements (e.g., camera occlusion or silence). Another advantage is the possibility of self-calibration of the joint system to compensate for imprecision in the knowledge of array or camera parameters by treating them as containing an unknown statistical component that can be determined using the particle filter framework during tracking. We implement the algorithm in the context of a videoconferencing and meeting recording system. The system also performs high-level semantic analysis of the scene by keeping participant tracks, recognizing turn-taking events and recording an annotated transcript of the meeting. Experimental results are presented. Our system operates in real time and is shown to be robust and reliable.},
	keywords = {audio-visual tracking, Monte-Carlo algorithms, sensor fusion},
	isbn = {1110-8657},
	doi = {10.1155/S1110865702206058},
	url = {http://dx.doi.org/10.1155/S1110865702206058},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S.}
}
@article {18232,
	title = {Joint coding and embedding for collusion-resistant fingerprinting},
	journal = {Proceedings of the European Signal Processing Conference, EUSIPCO},
	year = {2002},
	month = {2002///},
	abstract = {An effective attack against fingerprints for multimedia is collusion,where several differently marked copies of the same content are av-
eraged or combined to disrupt the underlying fingerprint. In this
paper, we investigate the problem of designing fingerprints that can
withstand collusion and allow for the identification of colluders. We
begin by introducing the collusion problem for additive embedding,
and introduce an efficient detection algorithm for orthogonal mod-
ulation that identifies the fingerprints associated with K colluders
and requires O(K log(n/K)) correlations for a group of n users.
We present a construction of collusion-resistant fingerprints based
upon anti-collusion codes (ACC) and binary code modulation. Us-
ing ACC, we build fingerprints that identify groups of K or less
colluders. We present a construction of binary-valued ACC un-
der the logical AND operation using the theory of combinatorial
designs. Our code construction requires only O(√n) orthogonal
signals to accommodate n users. We demonstrate the performance
of our ACC for fingerprinting multimedia and identifying colluders
through experiments using Gaussian signals.
},
	author = {Trappe,W. and Wu,M. and Liu,K. J.R}
}
@article {14912,
	title = {Judging whether multiple silhouettes can come from the same object},
	journal = {Visual Form 2001},
	year = {2001},
	month = {2001///},
	pages = {532 - 541},
	abstract = {We consider the problem of recognizing an object from its silhouette. We focus on the case in which the camera translates, and rotates about a known axis parallel to the image, such as when a mobile robot explores an environment. In this case we present an algorithm for determining whether a new silhouette could come from the same object that produced two previously seen silhouettes. In a basic case, when cross-sections of each silhouette are single line segments, we can check for consistency between three silhouettes using linear programming. This provides the basis for methods that handle more complex cases. We show many experiments that demonstrate the performance of these methods when there is noise, some deviation from the assumptions of the algorithms, and partial occlusion. Previous work has addressed the problem of precisely reconstructing an object using many silhouettes taken under controlled conditions. Our work shows that recognition can be performed without complete reconstruction, so that a small number of images can be used, with viewpoints that are only partly constrained.},
	doi = {10.1007/3-540-45129-3_49},
	author = {Jacobs, David W. and Belhumeur,P. and Jermyn,I.}
}
@article {16371,
	title = {The Java memory model is fatally flawed},
	journal = {Concurrency - Practice and Experience},
	volume = {12},
	year = {2000},
	month = {2000///},
	pages = {445 - 455},
	author = {Pugh, William}
}
@conference {12168,
	title = {Jazz: an extensible zoomable user interface graphics toolkit in Java},
	booktitle = {Proceedings of the 13th annual ACM symposium on User interface software and technology},
	year = {2000},
	month = {2000///},
	pages = {171 - 180},
	author = {Bederson, Benjamin B. and Meyer,J. and Good,L.}
}
@article {12385,
	title = {Joint minimization of code and data for synchronous dataflow programs},
	journal = {Formal Methods in System Design},
	volume = {11},
	year = {1997},
	month = {1997///},
	pages = {41 - 70},
	author = {Murthy,P. K and Bhattacharyya, Shuvra S. and Lee,E. A}
}
@conference {17857,
	title = {Jovian: A framework for optimizing parallel I/O},
	booktitle = {Scalable Parallel Libraries Conference, 1994., Proceedings of the 1994},
	year = {1994},
	month = {1994///},
	pages = {10 - 20},
	author = {Bennett, R. and Bryant,K. and Sussman, Alan and Das,R. and Saltz, J.}
}
@article {17270,
	title = {Jump searching: a fast sequential search technique},
	journal = {Communications of the ACM},
	volume = {21},
	year = {1978},
	month = {1978/10//},
	pages = {831 - 834},
	abstract = {When sequential file structures must be used and binary searching is not feasible, jump searching becomes an appealing alternative. This paper explores variants of the classic jump searching scheme where the optimum jump size is the square root of the number of records. Multiple level and variable size jump strategies are explored, appropriate applications are discussed and performance is evaluated.},
	keywords = {database structures, file management, index searching, jump searching, search strategies, sequential files},
	isbn = {0001-0782},
	doi = {10.1145/359619.359623},
	url = {http://doi.acm.org/10.1145/359619.359623},
	author = {Shneiderman, Ben}
}
