32 search results - page 4 / 7 » The set constraint CFL reachability connection in practice |
WEA
2010
Springer
14 years 17 days ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
MOBIHOC
2005
ACM
14 years 5 months ago
2005
ACM
Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, en...
TON
1998
13 years 5 months ago
1998
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...
CPAIOR
2011
Springer
12 years 9 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
We present a method for tracking a hand while it is interacting
with an object. This setting is arguably the one where
hand-tracking has most practical relevance, but poses signi...