7129 search results - page 812 / 1426 » Approximation Algorithms for Treewidth |
139
click to vote
ICIAR
2007
Springer
16 years 18 days ago
2007
Springer
To a large extent noise suppression algorithms have been designed to deal with the two most classically defined types of noise: impulsive and Gaussian noise. However digitized imag...
146
Voted
ISSAC
2007
Springer
16 years 18 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
168
click to vote
ICMCS
2006
IEEE
16 years 15 days ago
2006
IEEE
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
162
Voted
ICCV
2005
IEEE
16 years 2 days ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
185
click to vote
ICDCSW
2005
IEEE
16 years 2 days ago
2005
IEEE
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...