Sciweavers

392 search results - page 24 / 79
» Reversal Complexity Revisited
Sort
View
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 7 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
CPC
2004
98views more  CPC 2004»
13 years 7 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...
CEC
2010
IEEE
12 years 11 months ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis
CVPR
2006
IEEE
14 years 9 months ago
Multi-View Stereo Revisited
We present an extremely simple yet robust multi-view stereo algorithm and analyze its properties. The algorithm first computes individual depth maps using a window-based voting ap...
Michael Goesele, Brian Curless, Steven M. Seitz
WABI
2004
Springer
14 years 26 days ago
The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
Behshad Behzadi, Jean-Marc Steyaert