Sciweavers

4541 search results - page 61 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
BMCBI
2008
123views more  BMCBI 2008»
14 years 11 months ago
PocketMatch: A new algorithm to compare binding sites in protein structures
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...
Kalidas Yeturu, Nagasuma Chandra
89
Voted
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
15 years 11 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
89
Voted
MVA
2010
130views Computer Vision» more  MVA 2010»
14 years 9 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
15 years 4 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
15 years 11 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer