2950 search results - page 508 / 590 » Computing with Infinitely Many Processes |
124
Voted
BMCBI
2005
15 years 2 months ago
2005
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
153
click to vote
TOG
2008
15 years 2 months ago
2008
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...
107
click to vote
RAS
2000
15 years 2 months ago
2000
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...
119
click to vote
PVLDB
2008
15 years 1 months ago
2008
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 ...
141
Voted
CIKM
2010
Springer
15 years 27 days ago
2010
Springer
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...