Sciweavers

1554 search results - page 269 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
15 years 10 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
85
Voted
UC
2009
Springer
15 years 4 months ago
Brain Dynamics Promotes Function
Abstract. Dynamical structure in the brain promotes biological function. Natural scientists look for correlations between measured electrical signals and behavior or mental states....
Carlos Lourenço
SIGGRAPH
1996
ACM
15 years 2 months ago
Interactive Multiresolution Surface Viewing
Multiresolution analysis has been proposed as a basic tool supporting compression, progressive transmission, and level-of-detail control of complex meshes in a unified and theoret...
Andrew Certain, Jovan Popovic, Tony DeRose, Tom Du...
101
Voted
CORR
2010
Springer
249views Education» more  CORR 2010»
14 years 10 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
72
Voted
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 10 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson