Sciweavers

2127 search results - page 358 / 426
» Computing large matchings fast
Sort
View
TITB
1998
135views more  TITB 1998»
14 years 11 months ago
ViVa: the virtual vascular project
The aim of the ViVa project is to develop tools for the modern hemodynamicist and cardiovascular surgeon to study and interpret the constantly increasing amount of information bei...
Gassan Abdoulaev, Sandro Cadeddu, Giovanni Delussu...
CORR
2010
Springer
165views Education» more  CORR 2010»
14 years 10 months ago
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
Konstantin Avrachenkov, Nelly Litvak, Danil Nemiro...
CVPR
2007
IEEE
16 years 1 months ago
Spatial selection for attentional visual tracking
Long-duration tracking of general targets is quite challenging for computer vision, because in practice target may undergo large uncertainties in its visual appearance and the unc...
Ming Yang, Junsong Yuan, Ying Wu
ICDCS
2005
IEEE
15 years 5 months ago
Comparison of Approaches to Service Deployment
IT today is driven by the trend of increasing scale and complexity. Utility and Grid computing models, PlanetLab, and traditional data centers, are reaching the scale of thousands...
Vanish Talwar, Qinyi Wu, Calton Pu, Wenchang Yan, ...
SCFBM
2008
91views more  SCFBM 2008»
14 years 11 months ago
Simple tools for assembling and searching high-density picolitre pyrophosphate sequence data
Background: The advent of pyrophosphate sequencing makes large volumes of sequencing data available at a lower cost than previously possible. However, the short read lengths are d...
Nicolas J. Parker, Andrew G. Parker