Sciweavers

8413 search results - page 361 / 1683
» Ordering Problem Subgoals
Sort
View
185
Voted
INFOVIS
2002
IEEE
15 years 11 months ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel
183
Voted
ICALP
2001
Springer
15 years 11 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger
RTCSA
2000
IEEE
15 years 11 months ago
Extensions to optimistic concurrency control with time intervals
Although an optimistic approach has been shown to be better suited than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and h...
Jan Lindström
DAC
1996
ACM
15 years 10 months ago
Stochastic Sequential Machine Synthesis Targeting Constrained Sequence Generation
- The problem of stochastic sequential machines (SSM) synthesis is addressed and its relationship with the constrained sequence generation problem which arises during power estimat...
Diana Marculescu, Radu Marculescu, Massoud Pedram
ICASSP
2009
IEEE
15 years 10 months ago
Principal component analysis in decomposable Gaussian graphical models
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...
Ami Wiesel, Alfred O. Hero III