239 search results - page 34 / 48 » The path partition problem and related problems in bipartite... |
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
AMAI
2000
Springer
13 years 12 months ago
2000
Springer
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...