Sciweavers

2593 search results - page 53 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
PPOPP
2012
ACM
12 years 5 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
IJCV
1998
233views more  IJCV 1998»
13 years 9 months ago
A Level-Set Approach to 3D Reconstruction from Range Data
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
Ross T. Whitaker
BMCBI
2010
160views more  BMCBI 2010»
13 years 10 months ago
Identification of functional hubs and modules by converting interactome networks into hierarchical ordering of proteins
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...
Young-Rae Cho, Aidong Zhang
CAMP
2005
IEEE
14 years 3 months ago
Reinforcement Learning for P2P Searching
— For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured...
Luca Gatani, Giuseppe Lo Re, Alfonso Urso, Salvato...

Book
412views
15 years 9 months ago
Algorithms for Clustering Data
"Cluster analysis is an important technique in the rapidly growing field known as exploratory data analysis and is being applied in a variety of engineering and scientific dis...
A. K. Jain, R. C. Dubes