Sciweavers

198 search results - page 25 / 40
» Dynamic spatial approximation trees
Sort
View
INFOCOM
2005
IEEE
14 years 4 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...
AAAI
2011
12 years 11 months ago
Combining Learned Discrete and Continuous Action Models
Action modeling is an important skill for agents that must perform tasks in novel domains. Previous work on action modeling has focused on learning STRIPS operators in discrete, r...
Joseph Z. Xu, John E. Laird
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 4 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
GIS
2005
ACM
14 years 12 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
ICIP
2003
IEEE
15 years 16 days ago
Design of Q-shift complex wavelets for image processing using frequency domain energy minimization
This paper proposes a new method of designing finitesupport wavelet filters, based on minimization of energy in key parts of the frequency domain. In particular this technique is ...
Nick G. Kingsbury