535 search results - page 67 / 107 » Insertion and Expansion Operations for |
168
click to vote
VLDB
2001
ACM
16 years 2 days ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
101
click to vote
ICFP
2001
ACM
15 years 11 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
159
click to vote
ICML
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
– The design of a free piston compressor (FPC) intended as a pneumatic power supply for pneumatically actuated autonomous robots is presented in this paper. The FPC is a proposed...
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...