Sciweavers

1404 search results - page 198 / 281
» Optimization problems in multiple-interval graphs
Sort
View
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
15 years 3 months ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer
PR
2008
169views more  PR 2008»
14 years 9 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
GD
2001
Springer
15 years 2 months ago
Labeling Heuristics for Orthogonal Drawings
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
Carla Binucci, Walter Didimo, Giuseppe Liotta, Mad...
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
15 years 1 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky
INFOCOM
2009
IEEE
15 years 4 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...