4212 search results - page 786 / 843 » On Compressible Pairings and Their Computation |
162
click to vote
GD
2007
Springer
16 years 13 days ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
158
click to vote
GI
2007
Springer
16 years 13 days ago
2007
Springer
: We here report on a study exploring the use of augmented books for early literacy education. Children aged 6-7 interacted alone and in pairs with an AR-book. The study was iterat...
184
click to vote
DSN
2006
IEEE
16 years 10 days ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
169
click to vote
INFOCOM
2006
IEEE
16 years 9 days ago
2006
IEEE
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
166
click to vote
CONEXT
2006
ACM
16 years 7 days ago
2006
ACM
In this paper, we present a Mobile Agents based Framework for Routing and Congestion control in Mobile Ad Hoc Networks (MAFRC). The framework uses a cross-layer design approach wh...