Sciweavers

185 search results - page 21 / 37
» Precise complexity analysis for efficient datalog queries
Sort
View
ICDT
2009
ACM
109views Database» more  ICDT 2009»
15 years 10 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
15 years 9 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
ICIP
2002
IEEE
15 years 11 months ago
Exploiting group structure to improve retrieval accuracy and speed in image databases
Most image retrieval systems perform a linear search over the database to find the closest match to a query. However, databases usually exhibit a natural grouping structure into c...
Nuno Vasconcelos
TASLP
2008
176views more  TASLP 2008»
14 years 9 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
15 years 1 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass