54 search results - page 3 / 11 » The Complexity of Bottleneck Labeled Graph Problems |
ICIP
2010
IEEE
13 years 3 months ago
2010
IEEE
We consider a semi-supervised regression setting where we have temporal sequences of partially labeled data, under the assumption that the labels should vary slowly along a sequen...
IJAC
2007
13 years 5 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
PPOPP
2006
ACM
13 years 11 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
ICS
1993
Tsinghua U.
13 years 9 months ago
1993
Tsinghua U.
Performance monitoring of large scale parallel computers creates a dilemma: we need to collect detailed information to find performance bottlenecks, yet collecting all this data ...
ICDAR
2009
IEEE
13 years 3 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...