Sciweavers

2127 search results - page 132 / 426
» Computing large matchings fast
Sort
View
ICIP
2006
IEEE
16 years 5 months ago
Fast Construction of Covariance Matrices for Arbitrary Size Image Windows
We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator ...
Fatih Porikli, Oncel Tuzel
WWW
2010
ACM
15 years 11 months ago
Fast and parallel webpage layout
The web browser is a CPU-intensive program. Especially on mobile devices, webpages load too slowly, expending significant time in processing a document’s appearance. Due to powe...
Leo A. Meyerovich, Rastislav Bodík
ICCV
2007
IEEE
16 years 6 months ago
An Invariant Large Margin Nearest Neighbour Classifier
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
SIGMETRICS
2009
ACM
131views Hardware» more  SIGMETRICS 2009»
15 years 10 months ago
Modeling channel popularity dynamics in a large IPTV system
Understanding the channel popularity or content popularity is an important step in the workload characterization for modern information distribution systems (e.g., World Wide Web,...
Tongqing Qiu, Zihui Ge, Seungjoon Lee, Jia Wang, Q...
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
15 years 10 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland