525 search results - page 41 / 105 » Large Mesh Simplification using Processing Sequences |
102
click to vote
RECOMB
2010
Springer
15 years 2 months ago
2010
Springer
In this work we consider an inference task that biologists are very good at: deciphering biological processes by bringing together knowledge that has been obtained by experiments u...
180
Voted
VLDB
2008
ACM
16 years 21 days ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
103
Voted
ICIP
2002
IEEE
16 years 2 months ago
2002
IEEE
This paper presents a new object-based segmentation technique which exploits a large temporal context in order to get coherent and robust segmentation results. The segmentation pr...
206
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
124
Voted
CIKM
2010
Springer
14 years 11 months 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...