Sciweavers

2914 search results - page 556 / 583
» Optimization by Stochastic Continuation
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 8 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
EDBT
2008
ACM
156views Database» more  EDBT 2008»
14 years 7 months ago
Online recovery in cluster databases
Cluster based replication solutions are an attractive mechanism to provide both high-availability and scalability for the database backend within the multi-tier information system...
WeiBin Liang, Bettina Kemme
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 7 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
MOBIHOC
2008
ACM
14 years 7 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei
CVPR
2010
IEEE
14 years 4 months ago
Geodesic Graph Cut for Interactive Image Segmentation
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
Brian Price, Bryan Morse, Scott Cohen