2252 search results - page 138 / 451 » Lower Bounds for Dynamic Algorithms |
132
click to vote
JGAA
2006
15 years 3 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
136
Voted
VR
2010
IEEE
15 years 1 months ago
2010
IEEE
A collaborative virtual environment (CVE) allows remote users to access and modify shared data through networks, such as the Internet. However, when the users are connected via th...
100
Voted
SPDP
1991
IEEE
15 years 6 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
138
Voted
DAC
2009
ACM
16 years 4 months ago
2009
ACM
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
147
click to vote
NIPS
2007
15 years 4 months ago
2007
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...