Sciweavers

6480 search results - page 9 / 1296
» Proximity Communication and Time
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks
— Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing strategy p...
Vincent Lenders, Martin May, Bernhard Plattner
ICML
2008
IEEE
14 years 9 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ICDM
2005
IEEE
163views Data Mining» more  ICDM 2005»
14 years 2 months ago
Efficient Text Classification by Weighted Proximal SVM
In this paper, we present an algorithm that can classify large-scale text data with high classification quality and fast training speed. Our method is based on a novel extension o...
Dong Zhuang, Benyu Zhang, Qiang Yang, Jun Yan, Zhe...
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 10 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
PAAPP
1998
149views more  PAAPP 1998»
13 years 8 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha