Sciweavers

785 search results - page 37 / 157
» Two remarks on remotality
Sort
View
MST
2010
98views more  MST 2010»
13 years 8 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
13 years 7 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
CVPR
2011
IEEE
13 years 6 months ago
Learning invariance through imitation
Supervised methods for learning an embedding aim to map high-dimensional images to a space in which perceptually similar observations have high measurable similarity. Most approac...
Graham Taylor, Ian Spiro, Rob Fergus, Christoph Br...
FOSSACS
2011
Springer
13 years 1 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi
CVPR
2012
IEEE
12 years 9 days ago
A closed-form solution to uncalibrated photometric stereo via diffuse maxima
In this paper we propose a novel solution to uncalibrated photometric stereo. Our approach is to eliminate the socalled generalized bas relief (GBR) ambiguity by exploiting points...
Paolo Favaro, Thoma Papadhimitri