Sciweavers

6266 search results - page 48 / 1254
» New results on the computability and complexity of points - ...
Sort
View
DAM
2006
88views more  DAM 2006»
13 years 8 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
FOCS
2006
IEEE
14 years 2 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
SBIA
2004
Springer
14 years 2 months ago
An Experiment on Handshape Sign Recognition Using Adaptive Technology: Preliminary Results
This paper presents an overview of current work on the recognition of sign language and a prototype of a simple editor for a small subset of the Brazilian Sign Language, LIBRAS. Ha...
Hemerson Pistori, João José Neto
JMIV
2010
91views more  JMIV 2010»
13 years 7 months ago
Topological Properties of Thinning in 2-D Pseudomanifolds
Preserving topological properties of objects during thinning procedures is an important issue in the field of image analysis. In the case of 2-D digital images (i.e. images defi...
Nicolas Passat, Michel Couprie, Loïc Mazo, Gi...
JAT
2010
109views more  JAT 2010»
13 years 7 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi