Sciweavers

5221 search results - page 247 / 1045
» An On-line Problem Database
Sort
View
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
16 years 6 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
PODS
2003
ACM
114views Database» more  PODS 2003»
16 years 6 months ago
An information-theoretic approach to normal forms for relational and XML data
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
Marcelo Arenas, Leonid Libkin
EDBT
2004
ACM
110views Database» more  EDBT 2004»
16 years 6 months ago
Using Convolution to Mine Obscure Periodic Patterns in One Pass
The mining of periodic patterns in time series databases is an interesting data mining problem that can be envisioned as a tool for forecasting and predicting the future behavior o...
Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagar...
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
16 years 6 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
16 years 1 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer