Sciweavers

11214 search results - page 230 / 2243
» Just-in-time data structures
Sort
View
136
Voted
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 7 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
147
Voted
SIGIR
2012
ACM
13 years 3 months ago
Fighting against web spam: a novel propagation method based on click-through data
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
Chao Wei, Yiqun Liu, Min Zhang, Shaoping Ma, Liyun...
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
15 years 6 months ago
Indexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
Michael T. Goodrich, Mikhail J. Atallah, Roberto T...
DATE
2004
IEEE
136views Hardware» more  DATE 2004»
15 years 4 months ago
Data Windows: A Data-Centric Approach for Query Execution in Memory-Resident Databases
Structured embedded databases are currently becoming an integrated part of embedded systems, thus, enabling higher standards in system automation. These embedded databases are typ...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...
92
Voted
ICPR
2002
IEEE
15 years 5 months ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho