962 search results - page 114 / 193 » Efficient Algorithms for Eulerian Extension |
139
click to vote
DASFAA
2004
IEEE
15 years 3 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
122
click to vote
CIS
2006
Springer
15 years 3 months ago
2006
Springer
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementati...
112
click to vote
CGF
2010
14 years 12 months ago
2010
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
110
click to vote
CN
2006
14 years 12 months ago
2006
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...