459 search results - page 28 / 92 » Detecting induced subgraphs |
CIVR
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we develop a system to classify the outputs of image segmentation algorithms as perceptually relevant or perceptually irrelevant with respect to human perception. T...
ICCCN
2007
IEEE
14 years 2 months ago
2007
IEEE
- Ad hoc, actuator and sensor wireless networks normally have critical connectivity properties before becoming fault intolerant. Existing algorithms for testing k-connectivity are ...
ALGORITHMICA
2008
13 years 8 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
COCOON
2006
Springer
14 years 5 days ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...