Sciweavers

2612 search results - page 38 / 523
» Switching Graphs and Their Complexity
Sort
View
ICRA
2009
IEEE
110views Robotics» more  ICRA 2009»
14 years 4 months ago
Monocular stereo image processing using viewpoint switching iris
— In the recent years, intensive studies have been carried out on the measurement of distance by using stereo camera systems. However, image systems with multiple image sensors a...
Yuta Moriue, Takeshi Takaki, Kenichi Yamamoto, Ida...
ICALP
2004
Springer
14 years 3 months ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
ATAL
2005
Springer
14 years 3 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
JMLR
2006
118views more  JMLR 2006»
13 years 9 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
LPAR
2004
Springer
14 years 3 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel