77 search results - page 10 / 16 » Timing optimization by restructuring long combinatorial path... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— The dangerous and time sensitive nature of a disaster area makes it an ideal application for robotic exploration. Our long term goal is to enable humans, software agents, and a...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
EMMCVPR
2001
Springer
13 years 12 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
SIGECOM
2003
ACM
14 years 19 days ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...