20066 search results - page 3697 / 4014 » T Spaces |
187
click to vote
SIGCOMM
2005
ACM
16 years 10 days ago
2005
ACM
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior researc...
204
Voted
SIGCOMM
2005
ACM
16 years 10 days ago
2005
ACM
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end cong...
214
click to vote
SIGMOD
2005
ACM
16 years 10 days ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
187
click to vote
SMA
2005
ACM
16 years 10 days ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
179
click to vote
SPAA
2005
ACM
16 years 10 days ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...