Sciweavers

866 search results - page 22 / 174
» Extension of the direct optimization algorithm for noisy fun...
Sort
View
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
14 years 1 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
ICCAD
2009
IEEE
118views Hardware» more  ICCAD 2009»
13 years 5 months ago
Memory organization and data layout for instruction set extensions with architecturally visible storage
Present application specific embedded systems tend to choose instruction set extensions (ISEs) based on limitations imposed by the available data bandwidth to custom functional un...
Panagiotis Athanasopoulos, Philip Brisk, Yusuf Leb...
NIPS
1992
13 years 8 months ago
Some Solutions to the Missing Feature Problem in Vision
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
Subutai Ahmad, Volker Tresp
TNN
2008
102views more  TNN 2008»
13 years 7 months ago
A Class of Complex ICA Algorithms Based on the Kurtosis Cost Function
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
Hualiang Li, Tülay Adali
ICCV
2001
IEEE
14 years 9 months ago
Reconstructing Surfaces Using Anisotropic Basis Functions
Point sets obtained from computer vision techniques are often noisy and non-uniform. We present a new method of surface reconstruction that can handle such data sets using anisotr...
Huong Quynh Dinh, Greg Turk, Gregory G. Slabaugh