Sciweavers

583 search results - page 18 / 117
» Computing Linking Numbers of a Filtration
Sort
View
CONIELECOMP
2011
IEEE
13 years 1 months ago
DSRP: Distributed SensorWeb Routing Protocol
—We propose a new multi-hop routing protocol for wireless sensor networks, suited for monitoring and control applications. The aim of this research is to adapt flat and hierarch...
Abhinav Valada, David Kohanbash, George Kantor
FOCS
2008
IEEE
14 years 4 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
MSN
2007
Springer
14 years 4 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
CLEF
2011
Springer
12 years 9 months ago
Adapting Statistical Language Identification Methods for Short Queries
This paper describes the participation of UAIC team at the LogCLEF 2011 initiative, language identification task. Our approach is an aggregation of known methods for recognizing la...
Alexandru-Lucian Gînsca, Emanuela Boros, Adr...
MOBIHOC
2006
ACM
14 years 9 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...