Sciweavers

1983 search results - page 300 / 397
» Competitive graph searches
Sort
View
AIPS
2010
13 years 9 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
COMGEO
2007
ACM
13 years 7 months ago
Geometric spanners with applications in wireless networks
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
CGF
2008
151views more  CGF 2008»
13 years 7 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...
CVPR
2004
IEEE
14 years 10 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
ICCV
2007
IEEE
14 years 9 months ago
Learning Structured Appearance Models from Captioned Images of Cluttered Scenes
Given an unstructured collection of captioned images of cluttered scenes featuring a variety of objects, our goal is to learn both the names and appearances of the objects. Only a...
Michael Jamieson, Afsaneh Fazly, Sven J. Dickinson...