Sciweavers

1458 search results - page 165 / 292
» Monads for incremental computing
Sort
View
160
Voted
SIGGRAPH
1998
ACM
15 years 8 months ago
Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
John M. Snyder, Jed Lengyel
110
Voted
WWW
2003
ACM
16 years 4 months ago
Scaling personalized web search
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
Glen Jeh, Jennifer Widom
263
Voted
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
16 years 5 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
280
Voted
ICDE
2004
IEEE
259views Database» more  ICDE 2004»
16 years 5 months ago
Querying about the Past, the Present, and the Future in Spatio-Temporal
Moving objects (e.g., vehicles in road networks) continuously generate large amounts of spatio-temporal information in the form of data streams. Efficient management of such strea...
Jimeng Sun, Dimitris Papadias, Yufei Tao, Bin Liu
ICSE
2004
IEEE-ACM
16 years 3 months ago
Feature-Oriented Programming and the AHEAD Tool Suite
1 Feature Oriented Programming (FOP) is an emerging paradigm for application synthesis, analysis, and optimization. A target application is specified declaratively as a set of feat...
Don S. Batory