Sciweavers

316 search results - page 56 / 64
» Bounded Depth Data Trees
Sort
View
ANCS
2009
ACM
13 years 7 months ago
Range Tries for scalable address lookup
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
Ioannis Sourdis, Georgios Stefanakis, Ruben de Sme...
JMLR
2006
96views more  JMLR 2006»
13 years 9 months ago
A Hierarchy of Support Vector Machines for Pattern Detection
We introduce a computational design for pattern detection based on a tree-structured network of support vector machines (SVMs). An SVM is associated with each cell in a recursive ...
Hichem Sahbi, Donald Geman
VRCAI
2006
ACM
14 years 3 months ago
Parallel-split shadow maps for large-scale virtual environments
Shadowing effects dramatically enhance the realism of virtual environments by providing useful visual cues. Shadow mapping is an efficient algorithm for real-time shadow renderin...
Fan Zhang, Hanqiu Sun, Leilei Xu, Lee Kit Lun
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 26 days ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
SSD
2001
Springer
120views Database» more  SSD 2001»
14 years 1 months ago
On Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra