1067 search results - page 63 / 214 » Probabilistic regular graphs |
123
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
146
click to vote
ICVGIP
2004
15 years 4 months ago
2004
We present a new active active recognition scheme (using an uncalibrated camera) based on a new idea, appearancebased aspect graphs. The scheme is robust to background clutter, an...
159
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
136
click to vote
ICMLA
2009
15 years 25 days ago
2009
Abstract--We investigate parameter-based and distributionbased approaches to regularizing the generative, similarity-based classifier called local similarity discriminant analysis ...
148
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...