Sciweavers

2814 search results - page 71 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
USENIX
1990
13 years 11 months ago
A New Design for Distributed Systems: The Remote Memory Model
This paper describes a new model for constructing distributed systems called the Remote Memory Model. The remote memory model consists of several client machines, one or more dedi...
Douglas Comer, Jim Griffioen
ICCV
2011
IEEE
12 years 10 months ago
Distributed Cosegmentation via Submodular Optimization on Anisotropic Diffusion
The saliency of regions or objects in an image can be significantly boosted if they recur in multiple images. Leveraging this idea, cosegmentation jointly segments common regions...
Gunhee Kim, Eric P. Xing, Li Fei-Fei, Takeo Kanade
FOCS
2007
IEEE
14 years 4 months ago
A Primal-Dual Randomized Algorithm for Weighted Paging
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
SSD
2007
Springer
124views Database» more  SSD 2007»
14 years 4 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
WOSP
2004
ACM
14 years 3 months ago
Computing the performability of layered distributed systems with a management architecture
This paper analyzes the performability of client-server applications that use a separate fault management architecture for monitoring and controlling of the status of the applicat...
Olivia Das, C. Murray Woodside