Sciweavers

20441 search results - page 107 / 4089
» Locally Computable Structures
Sort
View
IPL
2008
145views more  IPL 2008»
13 years 9 months ago
Complexity analysis of a decentralised graph colouring algorithm
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov
STACS
2010
Springer
14 years 4 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
BIBE
2007
IEEE
152views Bioinformatics» more  BIBE 2007»
13 years 9 months ago
SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing
While much research has been done on finding similarities between protein sequences, there has not been the same progress on finding similarities between protein structures. Here ...
Tom Milledge, Gaolin Zheng, Tim Mullins, Giri Nara...
TMI
2010
155views more  TMI 2010»
13 years 3 months ago
Tubular Surface Segmentation for Extracting Anatomical Structures From Medical Imagery
Abstract--This work provides a model for tubular structures, and devises an algorithm to automatically extract tubular anatomical structures from medical imagery. Our model fits ma...
Vandana Mohan, Ganesh Sundaramoorthi, Allen Tannen...