820 search results - page 154 / 164 » Inducing Temporal Graphs |
213
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
The increasing availability of GPS-enabled devices is changing the way people interact with the Web, and brings us a large amount of GPS trajectories representing people's lo...
165
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
174
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
139
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
150
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...