Sciweavers

11716 search results - page 2188 / 2344
» Computable symbolic dynamics
Sort
View
OOPSLA
2007
Springer
14 years 4 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
SSD
2007
Springer
146views Database» more  SSD 2007»
14 years 4 months ago
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Ali Khoshgozaran, Cyrus Shahabi
CCGRID
2006
IEEE
14 years 4 months ago
Effective Load Balancing in P2P Systems
— In DHT based P2P systems, various issues such as peer heterogeneity, network topology, and diverse file popularity, may affect the DHT system efficiency. In this paper, we pr...
Zhiyong Xu, Laxmi N. Bhuyan
CVPR
2006
IEEE
14 years 4 months ago
Joint Recognition of Complex Events and Track Matching
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...
Michael T. Chan, Anthony Hoogs, Rahul Bhotika, A. ...
ESCIENCE
2006
IEEE
14 years 4 months ago
An Adaptive Algorithm for Information Dissemination in Self-Organizing Grids
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
« Prev « First page 2188 / 2344 Last » Next »