Sciweavers

494 search results - page 90 / 99
» Polynomial Equivalence Problems: Algorithmic and Theoretical...
Sort
View
CVIU
2011
12 years 11 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
TIP
2002
169views more  TIP 2002»
13 years 7 months ago
On the origin of the bilateral filter and ways to improve it
Abstract--Additive noise removal from a given signal is an important problem in signal processing. Among the most appealing aspects of this field are the ability to refer it to a w...
Michael Elad
FOCS
2008
IEEE
14 years 2 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder

Publication
233views
12 years 6 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
14 years 2 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella