Sciweavers

615 search results - page 17 / 123
» step 2003
Sort
View
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
15 years 2 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
ICSE
2003
IEEE-ACM
15 years 9 months ago
Moving from Quality Attribute Requirements to Architectural Decisions
Quality attribute models are proposed as the linkage between a specification of a quality attribute requirement and a design fragment that is focused on achieving that requirement...
Felix Bachmann, Len Bass, Mark Klein
74
Voted
ICML
2003
IEEE
15 years 10 months ago
Kernel PLS-SVC for Linear and Nonlinear Classification
A new method for classification is proposed. This is based on kernel orthonormalized partial least squares (PLS) dimensionality reduction of the original data space followed by a ...
Roman Rosipal, Leonard J. Trejo, Bryan Matthews
UAI
2003
14 years 11 months ago
Symbolic Generalization for On-line Planning
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein
CVPR
2003
IEEE
15 years 11 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler