Sciweavers

5473 search results - page 843 / 1095
» On the graph isomorphism problem
Sort
View
SIGCOMM
2004
ACM
15 years 12 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
DAGM
2004
Springer
15 years 12 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
DEXA
2004
Springer
136views Database» more  DEXA 2004»
15 years 12 months ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...
ECAI
2004
Springer
15 years 12 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
ISCC
2003
IEEE
113views Communications» more  ISCC 2003»
15 years 12 months ago
Channel Sharing of Competing Flows in Ad Hoc Networks
This paper studies the fairness with which competing flows share the channel in ad hoc networks using collision avoidance protocols. It is shown that the required multihop coordi...
Yu Wang, J. J. Garcia-Luna-Aceves