Sciweavers

2814 search results - page 412 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
COMPGEOM
2006
ACM
14 years 4 months ago
Embedding ultrametrics into low-dimensional spaces
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
ICIAP
1999
ACM
14 years 2 months ago
Random Walk Approach to Image Enhancement
The paper presents a new technique of image enhancement. The described algorithm enables the suppression of noise and contrast enhancement. The interesting feature of this new alg...
Bogdan Smolka, Konrad W. Wojciechowski, Marek Szcz...
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 12 months ago
Online Anomaly Prediction for Robust Cluster Systems
In this paper, we present a stream-based mining algorithm for online anomaly prediction. Many real-world applications such as data stream analysis requires continuous cluster opera...
Xiaohui Gu, Haixun Wang
MOBIHOC
2009
ACM
14 years 10 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 10 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth