142 search results - page 19 / 29 » Computing Nash Equilibria: Approximation and Smoothed Comple... |
WINE
2005
Springer
15 years 5 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
128
Voted
SMA
2009
ACM
15 years 6 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
101
click to vote
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
Piecewise constant and piecewise smooth Mumford-Shah (MS) models have been widely studied and used for image segmentation. More complicated than piecewise constant MS, global Gaus...
110
click to vote
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
129
click to vote
FGR
2011
IEEE
14 years 3 months ago
2011
IEEE
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...