3471 search results - page 306 / 695 » Obstacle Numbers of Graphs |
184
click to vote
CVPR
2006
IEEE
16 years 23 days ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
203
Voted
PDP
2005
IEEE
16 years 9 days ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
161
click to vote
VLDB
2005
ACM
16 years 6 days ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
174
click to vote
CP
2004
Springer
16 years 3 days ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
184
click to vote
DASFAA
2010
IEEE
15 years 12 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...