Sciweavers

3946 search results - page 283 / 790
» The computational complexity of choice sets
Sort
View
IWPEC
2004
Springer
16 years 3 days ago
A Structural View on Parameterizing Problems: Distance from Triviality
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
Jiong Guo, Falk Hüffner, Rolf Niedermeier
ICPR
2008
IEEE
16 years 8 months ago
Joint visual vocabulary for animal classification
This paper presents a method for visual object categorization based on encoding the joint textural information in objects and the surrounding background, and requiring no segmenta...
Alireza Tavakoli Targhi, Andrzej Pronobis, Heydar ...
JMM2
2007
96views more  JMM2 2007»
15 years 6 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
CEC
2007
IEEE
16 years 1 months ago
Automated design of a MEMS resonator
—As the application and complexity of microelectromechanical (MEMS) devices increases, there is a corresponding need for automated design and optimization tools to augment engine...
Jason D. Lohn, William F. Kraus, Gregory S. Hornby
IPPS
2007
IEEE
16 years 1 months ago
A WSRF-Compliant Debugger for Grid Applications
Grid computing allows the utilization of vast computational resources for solving complex scientific and engineering problems. However, development tools for Grid applications are...
Donny Kurniawan, David Abramson