Sciweavers

199 search results - page 7 / 40
» Recognizing HHDS-Free Graphs
Sort
View
SPEECH
2002
66views more  SPEECH 2002»
13 years 9 months ago
Spanish recognizer of continuously spelled names over the telephone
In this paper we present a hypothesis-verification approach for a Spanish Recognizer of continuously spelled names over the telephone. We give a detailed description of the spelli...
Rubén San Segundo, José Colás...
GD
2009
Springer
14 years 1 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
13 years 9 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
DAM
2008
123views more  DAM 2008»
13 years 10 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
CVPR
2008
IEEE
14 years 11 months ago
Clothing cosegmentation for recognizing people
Reseachers have verified that clothing provides information about the identity of the individual. To extract features from the clothing, the clothing region first must be localize...
Andrew C. Gallagher, Tsuhan Chen