Sciweavers

32545 search results - page 175 / 6509
» Data Structures and Algorithms
Sort
View
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
15 years 9 months ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba
108
Voted
PKDD
2005
Springer
89views Data Mining» more  PKDD 2005»
15 years 8 months ago
Numbers in Multi-relational Data Mining
Numeric data has traditionally received little attention in the field of Multi-Relational Data Mining (MRDM). It is often assumed that numeric data can simply be turned into symbol...
Arno J. Knobbe, Eric K. Y. Ho
151
Voted
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
15 years 9 months ago
Adaptive Execution of Stream Window Joins in a Limited Memory Environment
A sliding window join (SWJoin) is becoming an integral operation in every stream data management system. In some streaming applications the increasing volume of streamed data as w...
Fatima Farag, Moustafa A. Hammad
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 7 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
JAR
2006
236views more  JAR 2006»
15 years 3 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard