Sciweavers

418 search results - page 7 / 84
» Circularity Measuring in Linear Time
Sort
View
WG
1998
Springer
15 years 3 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
RC
2007
148views more  RC 2007»
14 years 11 months ago
Computing Population Variance and Entropy under Interval Uncertainty: Linear-Time Algorithms
In statistical analysis of measurement results, it is often necessary to compute the range [V , V ] of the population variance V = 1 n · n i=1 (xi −E)2 (where E = 1 n · n i=1 ...
Gang Xiang, Martine Ceberio, Vladik Kreinovich
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
15 years 5 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
CGF
1999
128views more  CGF 1999»
14 years 11 months ago
Creating Architectural Models from Images
We present methods for creating 3D graphical models of scenes from a limited numbers of images, i.e. one or two, in situations where no scene co-ordinate measurements are availabl...
David Liebowitz, Antonio Criminisi, Andrew Zisserm...
CORR
2004
Springer
121views Education» more  CORR 2004»
14 years 11 months ago
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
Erik G. Boman, Bruce Hendrickson, Stephen A. Vavas...