Sciweavers

113 search results - page 19 / 23
» The containment problem for REAL conjunctive queries with in...
Sort
View
PAMI
2011
13 years 3 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
SIGMOD
2003
ACM
111views Database» more  SIGMOD 2003»
14 years 8 months ago
Extended Wavelets for Multiple Measures
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
Antonios Deligiannakis, Nick Roussopoulos
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 10 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
WISE
2005
Springer
14 years 2 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
EDBT
2009
ACM
116views Database» more  EDBT 2009»
14 years 1 months ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...