Sciweavers

77 search results - page 8 / 16
» Robust Subgraphs for Trees and Paths
Sort
View
ACL
2006
13 years 8 months ago
Bootstrapping Path-Based Pronoun Resolution
We present an approach to pronoun resolution based on syntactic paths. Through a simple bootstrapping procedure, we learn the likelihood of coreference between a pronoun and a can...
Shane Bergsma, Dekang Lin
ICNP
2003
IEEE
14 years 19 days ago
Resilient Peer-to-Peer Streaming
We consider the problem of distributing “live” streaming media content to a potentially large and highly dynamic population of hosts. Peer-to-peer content distribution is attr...
Venkata N. Padmanabhan, Helen J. Wang, Philip A. C...
GLOBECOM
2006
IEEE
14 years 1 months ago
Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
Preetha Thulasiraman, Srinivasan Ramasubramanian, ...
INFOCOM
2008
IEEE
14 years 1 months ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
ORL
2008
99views more  ORL 2008»
13 years 7 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...