2907 search results - page 34 / 582 » Presentations of Structures in Admissible Sets |
JACM
2007
13 years 8 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
MICRO
2009
IEEE
14 years 3 months ago
2009
IEEE
Efficient memory hierarchy design is critical due to the increasing gap between the speed of the processors and the memory. One of the sources of inefficiency in current caches is...
HEURISTICS
2008
13 years 7 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
XIMEP
2005
ACM
14 years 2 months ago
2005
ACM
There are three set operators defined in XQuery, namely union, intersect and except. They take node sequences as operands, in which each node is identified by its node-ID and tr...