6654 search results - page 920 / 1331 » Querying Faceted Databases |
214
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed sha...
176
click to vote
ICIP
1999
IEEE
16 years 8 months ago
1999
IEEE
Researchers are currently more interested in searching for fragments that are similar to a query, than a total data item that is similar to a query; the search interest is for &qu...
260
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
We present a collaborative, self-configuring high availability (HA) approach for stream processing that enables low-latency failure recovery while incurring small run-time overhea...
271
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
316
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...