312 search results - page 25 / 63 » An experimental study on algorithms for drawing binary trees |
DMKD
2003
ACM
14 years 23 days ago
2003
ACM
HTML anchors are often surrounded by text that seems to describe the destination page appropriately. The text surrounding a link or the link-context is used for a variety of tasks...
PDPTA
2003
13 years 9 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
ESA
2011
Springer
12 years 7 months ago
2011
Springer
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
JCDL
2006
ACM
14 years 1 months ago
2006
ACM
Document clustering has been used for better document retrieval, document browsing, and text mining in digital library. In this paper, we perform a comprehensive comparison study ...
SIGCOMM
2005
ACM
14 years 1 months ago
2005
ACM
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...