664 search results - page 49 / 133 » Solution to the Counterfeit Coin Problem and its Generalizat... |
151
click to vote
SIGGRAPH
1996
ACM
15 years 2 months ago
1996
ACM
A classical problem of imaging--the matting problem--is separation of a non-rectangular foreground image from a (usually) rectangular background image--for example, in a film fram...
ICALP
1997
Springer
15 years 2 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
JMMA
2010
14 years 4 months ago
2010
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
JMLR
2006
14 years 9 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...