1086 search results - page 18 / 218 » Jug measuring: Algorithms and complexity |
86
Voted
ICIP
1997
IEEE
16 years 2 months ago
1997
IEEE
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
121
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
128
click to vote
SODA
2000
ACM
15 years 2 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
ISAAC
2001
Springer
15 years 5 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
133
click to vote
WD
2010
14 years 11 months ago
2010
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theo...