Sciweavers

1091 search results - page 89 / 219
» Approximation in Databases
Sort
View
259
Voted
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 5 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
ICDE
2005
IEEE
185views Database» more  ICDE 2005»
16 years 4 months ago
A Multiresolution Symbolic Representation of Time Series
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Chr...
ICDE
2008
IEEE
133views Database» more  ICDE 2008»
15 years 9 months ago
Discovering popular co-cited communities in blogspaces
In a blogspace, citation behaviors reflect interests of bloggers. To fully get insight into the latent information in a blogspace, in this paper, we intend to mine popular co-cit...
Meng-Fen Chiang, Wen-Chih Peng, Chia-Hao Lo
120
Voted
PODS
2010
ACM
197views Database» more  PODS 2010»
15 years 2 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
120
Voted
JUCS
2002
131views more  JUCS 2002»
15 years 2 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici