650 search results - page 70 / 130 » Positive graphs |
IWPEC
2004
Springer
14 years 3 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
INTELLCOMM
2004
Springer
14 years 3 months ago
2004
Springer
We present the design, implementation and evaluation of a location detection system built over a Radio Frequency network based on the IEEE 802.11 standard. Our system employs beac...
NIPS
2007
13 years 11 months ago
2007
This paper introduces kernels on attributed pointsets, which are sets of vectors embedded in an euclidean space. The embedding gives the notion of neighborhood, which is used to d...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...