Sciweavers

217 search results - page 24 / 44
» Elimination Graphs
Sort
View
COMCOM
2008
99views more  COMCOM 2008»
13 years 7 months ago
Reliability improvement for an RFID-based psychiatric patient localization system
Collaboration between Field Generators, Readers and Tags generates the required functions in using radio frequency identification (RFID) for psychiatric patient localization. The ...
Chieh-Ling Huang, Pau-Choo Chung, Ming-Hua Tsai, Y...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 9 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
ADHOC
2005
102views more  ADHOC 2005»
13 years 8 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
INFOCOM
2012
IEEE
11 years 11 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
CP
2008
Springer
13 years 10 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni