Sciweavers

539 search results - page 103 / 108
» An Improved Upper Bound for SAT
Sort
View
ICIP
2006
IEEE
14 years 9 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
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 7 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
CLUSTER
2009
IEEE
14 years 2 months ago
Utility analysis for Internet-oriented server consolidation in VM-based data centers
—Server consolidation based on virtualization technology will simplify system administration, reduce the cost of power and physical infrastructure, and improve utilization in tod...
Ying Song, Yanwei Zhang, Yuzhong Sun, Weisong Shi
FOCS
2009
IEEE
14 years 2 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich