Sciweavers

6274 search results - page 483 / 1255
» From query complexity to computational complexity
Sort
View
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 7 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
LATIN
2004
Springer
16 years 9 days ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
FOCS
2004
IEEE
15 years 10 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
ICIP
2003
IEEE
16 years 8 months ago
Shape analysis algorithm based on information theory
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
Andreas Koschan, Besma Roui-Abidi, David L. Page, ...
ICASSP
2009
IEEE
16 years 1 months ago
Rate-distortion optimized bitstream extractor for motion scalability in scalable video coding
Motion scalability is designed to improve the coding efficiency of a scalable video coding framework, especially in the medium to low range of decoding bit rates or spatial resol...
Meng-Ping Kao, Truong Nguyen