Sciweavers

1259 search results - page 67 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
INFOCOM
2005
IEEE
15 years 10 months ago
Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network
— Even though multiple non-overlapped channels exist in the 2.4GHz and 5GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a resul...
Ashish Raniwala, Tzi-cker Chiueh
GLOBECOM
2009
IEEE
15 years 7 months ago
A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model
—In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols fo...
Dejun Yang, Xi Fang, Nan Li, Guoliang Xue
MOBIHOC
2009
ACM
16 years 5 months ago
WARPnet: clean slate research on deployed wireless networks
In this demo we present the Wireless Open-Access Research Platform for Networks (WARPnet), a research testbed aimed at performing experiments at the network level. The platform is...
Siddharth Gupta, Chris Hunter, Patrick Murphy, Ash...
CVPR
2007
IEEE
16 years 6 months ago
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
We present a scalable approach to recognizing and describing complex activities in video sequences. We are interested in long-term, sequential activities that may have several par...
Benjamin Laxton, Jongwoo Lim, David J. Kriegman
CP
1998
Springer
15 years 8 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow