Sciweavers

4536 search results - page 640 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
WWW
2007
ACM
16 years 7 months ago
U-REST: an unsupervised record extraction system
In this paper, we describe a system that can extract record structures from web pages with no direct human supervision. Records are commonly occurring HTML-embedded data tuples th...
Yuan Kui Shen, David R. Karger
SMI
2008
IEEE
131views Image Analysis» more  SMI 2008»
16 years 1 months ago
Segmentation-free skeletonization of grayscale volumes for shape understanding
Medical imaging has produced a large number of volumetric images capturing biological structures in 3D. Computer-based understanding of these structures can often benefit from th...
Sasakthi S. Abeysinghe, Matthew L. Baker, Wah Chiu...
SPIRE
2007
Springer
16 years 23 days 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 ...
CP
2005
Springer
16 years 6 days ago
Applying Constraint Programming to Rigid Body Protein Docking
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
Ludwig Krippahl, Pedro Barahona
IFIP
2004
Springer
16 years 1 days ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...