Sciweavers

1679 search results - page 117 / 336
» Pointcuts as Functional Queries
Sort
View
SAC
2008
ACM
15 years 4 months ago
Extending peer-to-peer networks for approximate search
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
Alain Mowat, Roman Schmidt, Michael Schumacher, Io...
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 4 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
VLDB
1989
ACM
150views Database» more  VLDB 1989»
15 years 8 months ago
Aggregates in Possibilistic Databases
Fuzzy set theory represents a uniform framework for extending the relational database model to han-, dle imprecision of information found in the real world. None of the existing p...
Elke A. Rundensteiner, Lubomir Bic
CIKM
2010
Springer
15 years 2 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
TVCG
2012
178views Hardware» more  TVCG 2012»
13 years 7 months ago
Human Motion Retrieval from Hand-Drawn Sketch
—The rapid growth of motion capture data increases the importance of motion retrieval. The majority of the existing motion retrieval approaches are based on a labor-intensive ste...
Min-Wen Chao, Chao-Hung Lin, Jackie Assa, Tong-Yee...