Sciweavers

1568 search results - page 127 / 314
» The problem of examination questions in algorithmics
Sort
View
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 1 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 5 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
157
Voted
IJCV
2008
102views more  IJCV 2008»
15 years 4 months ago
Modeling the World from Internet Photo Collections
Abstract There are billions of photographs on the Internet, comprising the largest and most diverse photo collection ever assembled. How can computer vision researchers exploit thi...
Noah Snavely, Steven M. Seitz, Richard Szeliski
DAGSTUHL
2007
15 years 6 months ago
Exact Elimination of Cycles in Graphs
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
Daniel Raible, Henning Fernau
GECCO
2009
Springer
15 years 9 months ago
NEAT in increasingly non-linear control situations
Evolution of neural networks, as implemented in NEAT, has proven itself successful on a variety of low-level control problems such as pole balancing and vehicle control. Nonethele...
Matthias J. Linhardt, Martin V. Butz