7133 search results - page 1277 / 1427 » Communication algorithms with advice |
184
click to vote
GD
2001
Springer
15 years 11 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
179
click to vote
ICVS
2001
Springer
15 years 11 months ago
2001
Springer
Interactive robotics demands real-time visual information about the environment. Real time vision processing, however, places a heavy load on the robot’s limited resources, and m...
165
click to vote
KI
2001
Springer
15 years 11 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
179
click to vote
FGR
2000
IEEE
15 years 11 months ago
2000
IEEE
Most automatic expression analysis systems attempt to recognize a small set of prototypic expressions (e.g. happiness and anger). Such prototypic expressions, however, occur infre...
162
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...