706 search results - page 96 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
SIGMOD
2001
ACM
14 years 9 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
BROADNETS
2006
IEEE
14 years 18 days ago
2006
IEEE
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
We study the challenging problem of maneuvering object tracking with unknown dynamics, i.e., forces or torque. We investigate the underlying causes of object kinematics, and propo...
FGCN
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...