Sciweavers

2796 search results - page 485 / 560
» The coolest path problem
Sort
View
165
Voted
ICASSP
2010
IEEE
15 years 5 months ago
Graph based event detection from realistic videos using weak feature correspondence
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
Lei Ding, Quanfu Fan, Jen-Hao Hsiao, Sharath Panka...
ADHOC
2008
96views more  ADHOC 2008»
15 years 5 months ago
Network configuration for optimal utilization efficiency of wireless sensor networks
This paper addresses the problem of configuring wireless sensor networks (WSNs). Specifically, we seek answers to the following questions: how many sensors should be deployed, wha...
Yunxia Chen, Chen-Nee Chuah, Qing Zhao
144
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 5 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal
69
Voted
CORR
2010
Springer
59views Education» more  CORR 2010»
15 years 5 months ago
The Light of Existence
This chapter derives the properties of light from the properties of processing, including its ability to be both a wave and a particle, to detect objects it doesn't touch, to...
Brian Whitworth
CN
2006
73views more  CN 2006»
15 years 5 months ago
Rate-distortion based link state update
Finding paths that satisfy the performance requirements of applications according to the link state information in a network is known as the quality-of-service (QoS) routing probl...
Gang Cheng, Nirwan Ansari