Sciweavers

81 search results - page 14 / 17
» Parameterized algorithmics for linear arrangement problems
Sort
View
NETWORKS
2010
13 years 6 months ago
Fixed-parameter tractability results for full-degree spanning tree and its dual
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
CHI
1996
ACM
13 years 11 months ago
Silk from a Sow's Ear: Extracting Usable Structures from the Web
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...
Peter Pirolli, James E. Pitkow, Ramana Rao
TMI
2010
164views more  TMI 2010»
13 years 2 months ago
Robust Reconstruction of MRSI Data Using a Sparse Spectral Model and High Resolution MRI Priors
We introduce a novel algorithm to address the challenges in magnetic resonance (MR) spectroscopic imaging. In contrast to classical sequential data processing schemes, the proposed...
Ramin Eslami, Mathews Jacob
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
13 years 7 months ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning
ICA
2004
Springer
14 years 28 days ago
Second-Order Blind Source Separation Based on Multi-dimensional Autocovariances
SOBI is a blind source separation algorithm based on time decorrelation. It uses multiple time autocovariance matrices, and performs joint diagonalization thus being more robust th...
Fabian J. Theis, Anke Meyer-Bäse, Elmar Wolfg...