569 search results - page 41 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We propose a novel energy minimisation framework for the dense reconstruction of stereo image sequences that incorporates data fidelity as well as spatial and temporal regularity....
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
AAAI
2006
13 years 9 months ago
2006
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...