Sciweavers

2950 search results - page 508 / 590
» Computing with Infinitely Many Processes
Sort
View
BMCBI
2005
136views more  BMCBI 2005»
13 years 8 months ago
Automatic detection of false annotations via binary property clustering
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
Noam Kaplan, Michal Linial
TOG
2008
239views more  TOG 2008»
13 years 8 months ago
Skeleton extraction by mesh contraction
eleton is a very useful 1D structure to abstract the geometry and topology of a 3D object. Extraction of curve-skeletons is a fundamental problem in computer graphics, visualizatio...
Oscar Kin-Chung Au, Chiew-Lan Tai, Hung-Kuo Chu, D...
RAS
2000
106views more  RAS 2000»
13 years 8 months ago
Robust localization of auditory and visual targets in a robotic barn owl
In the last two decades, the barn owl, a nocturnal predator with accurate visual and auditory capabilities, has become a common experimental system for neuroscientists investigati...
Michele Rucci, Jonathan Wray, Gerald M. Edelman
PVLDB
2008
116views more  PVLDB 2008»
13 years 8 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
CIKM
2010
Springer
13 years 7 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...