3020 search results - page 509 / 604 » Optimal partition trees |
261
click to vote
VLDB
2002
ACM
16 years 5 months ago
2002
ACM
Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based u...
156
click to vote
PODS
2006
ACM
16 years 5 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
138
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
144
click to vote
ICDE
2010
IEEE
16 years 15 days ago
2010
IEEE
— Information extraction systems are traditionally implemented as a pipeline of special-purpose processing modules. A major drawback of such an approach is that whenever a new ex...
168
click to vote
GLOBECOM
2009
IEEE
16 years 11 days ago
2009
IEEE
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...