Sciweavers

9842 search results - page 165 / 1969
» Problem complexity
Sort
View
DAWAK
2000
Springer
15 years 6 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 7 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ICASSP
2011
IEEE
14 years 6 months ago
Image filtering: Potential efficiency and current problems
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...
Vladimir V. Lukin, Sergey K. Abramov, Nikolay N. P...
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 7 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
15 years 8 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman