Sciweavers

ACMSE
2000
ACM
13 years 9 months ago
Exploring an information-based approach to computation and computational complexity
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
D. E. Stevenson
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
13 years 9 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun

Publication
464views
13 years 9 months ago
Fast image and video denoising via nonlocal means of similar neighborhoods
In this note, improvements to the non-local means image denoising method introduced in [2], [3] are presented. The original non-local means method replaces a noisy pixel by the ...
Mona Mahmoudi, Guillermo Sapiro
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
13 years 9 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
INFOCOM
2002
IEEE
13 years 9 months ago
A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
Ariel Orda, Alexander Sprintson
ISCAS
2003
IEEE
89views Hardware» more  ISCAS 2003»
13 years 10 months ago
DCT-based video frame-skipping transcoder
Due to high computational complexity and quality degradation introduced by conventional frame-skipping transcoders, a DCT-based video frame-skipping transcoder is proposed recentl...
Kai-Tat Fung, Wan-Chi Siu
ICCS
2004
Springer
13 years 10 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
ECAI
2004
Springer
13 years 10 months ago
Focusing Reasoning Through Emotional Mechanisms
Abstract. In concrete environments, where uncertainty and dynamism are pervasive and time and resources are limited, reasoning and decision-making processes raise important problem...
Luís Morgado, Graça Gaspar
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
13 years 10 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
COMPGEOM
2004
ACM
13 years 10 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount