Sciweavers

PASTE
2004
ACM
14 years 5 months ago
An improved slicer for Java
We present an improved slicing algorithm for Java. The best algorithm known so far, first presented in [11], is not always precise if nested objects are used as actual parameters...
Christian Hammer, Gregor Snelting
MMDB
2004
ACM
132views Multimedia» more  MMDB 2004»
14 years 5 months ago
The priority curve algorithm for video summarization
In this paper, we introduce the concept of a priority curve associated with a video. We then provide an algorithm that can use the priority curve to create a summary (of a desired...
Marat Fayzullin, V. S. Subrahmanian, Massimiliano ...
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
14 years 5 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
DIALM
2004
ACM
124views Algorithms» more  DIALM 2004»
14 years 5 months ago
Localized techniques for broadcasting in wireless sensor networks
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
Lorenzo Orecchia, Alessandro Panconesi, Chiara Pet...
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
14 years 5 months ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...
DIALM
2004
ACM
121views Algorithms» more  DIALM 2004»
14 years 5 months ago
Unit disk graph approximation
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
14 years 5 months ago
OVSF-CDMA code assignment in wireless ad hoc networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading...
Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
14 years 5 months ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi
COMPGEOM
2004
ACM
14 years 5 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
COMPGEOM
2004
ACM
14 years 5 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...