Sciweavers

226 search results - page 41 / 46
» A Practical Algorithm to Find the Best Subsequence Patterns
Sort
View
ICC
2008
IEEE
115views Communications» more  ICC 2008»
14 years 1 months ago
Oblivious Routing for Wireless Mesh Networks
—Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing pl...
Jonathan Wellons, Yuan Xue
CVPR
2004
IEEE
14 years 9 months ago
High-Zoom Video Hallucination by Exploiting Spatio-Temporal Regularities
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...
Göksel Dedeoglu, Jonas August, Takeo Kanade
PPOPP
2010
ACM
14 years 4 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
ICCV
1999
IEEE
13 years 11 months ago
Camera Calibration and the Search for Infinity
This paper considers the problem of self-calibration of a camera from an image sequence in the case where the camera's internal parameters (most notably focal length) may cha...
Richard I. Hartley, Lourdes de Agapito, Ian D. Rei...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 7 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos