138 search results - page 6 / 28 » The Hypocoloring Problem: Complexity and Approximability Res... |
DAM
2006
13 years 7 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
NPAR
2004
ACM
14 years 24 days ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...