4037 search results - page 733 / 808 » Routing without ordering |
277
click to vote
COMPGEOM
2010
ACM
16 years 10 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
174
click to vote
PODS
2010
ACM
16 years 10 days ago
2010
ACM
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
199
click to vote
WEBDB
2010
Springer
16 years 9 days ago
2010
Springer
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
193
click to vote
ICTAI
2002
IEEE
16 years 6 days ago
2002
IEEE
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...
206
click to vote
SIGMETRICS
2010
ACM
16 years 2 days ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...