Sciweavers

2593 search results - page 407 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
IPMI
2005
Springer
16 years 3 months ago
Surface Matching via Currents
Abstract. We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is in buildin...
Marc Vaillant, Joan Glaunes
SPIRE
2007
Springer
15 years 8 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
88
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 3 months ago
A linear lower bound on index size for text retrieval
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
Erik D. Demaine, Alejandro López-Ortiz
116
Voted
BIOINFORMATICS
2006
101views more  BIOINFORMATICS 2006»
15 years 2 months ago
A lock-and-key model for protein-protein interactions
Motivation: Protein-protein interaction networks are one of the major post-genomic data sources available to molecular biologists. They provide a comprehensive view of the global ...
Julie L. Morrison, Rainer Breitling, Desmond J. Hi...
ICTAC
2010
Springer
15 years 10 days ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett