Sciweavers

239 search results - page 43 / 48
» The path partition problem and related problems in bipartite...
Sort
View
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 29 days ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
WINET
2010
128views more  WINET 2010»
13 years 5 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
CICLING
2011
Springer
12 years 11 months ago
Temporal Analysis of Sentiment Events - A Visual Realization and Tracking
In recent years, extraction of temporal relations for events that express sentiments has drawn great attention of the Natural Language Processing (NLP) research communities. In thi...
Dipankar Das, Anup Kumar Kolya, Asif Ekbal, Sivaji...
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
13 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
INFOCOM
2009
IEEE
14 years 2 months ago
Tracking with Unreliable Node Sequences
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
Ziguo Zhong, Ting Zhu, Dan Wang, Tian He