Sciweavers

42230 search results - page 379 / 8446
» Algorithms and Complexity Results for
Sort
View
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 7 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 4 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
ICMCS
2006
IEEE
189views Multimedia» more  ICMCS 2006»
16 years 26 days ago
Multiscale Edge-Based Text Extraction from Complex Images
Text that appears in images contains important and useful information. Detection and extraction of text in images have been used in many applications. In this paper, we propose a ...
Xiaoqing Liu, Jagath Samarabandu
161
Voted
SSS
2009
Springer
115views Control Systems» more  SSS 2009»
15 years 11 months ago
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
Alain Cournier, Swan Dubois, Vincent Villain
TSP
2008
74views more  TSP 2008»
15 years 6 months ago
Performance of ESPRIT for Estimating Mixtures of Complex Exponentials Modulated by Polynomials
High Resolution (HR) methods are known to provide accurate frequency estimates for discrete spectra. The Polynomial Amplitude Complex Exponentials (PACE) model, also called quasipo...
Roland Badeau, Gaël Richard, Bertrand David