Sciweavers

851 search results - page 35 / 171
» An exact algorithm for solving the vertex separator problem
Sort
View
ESANN
2006
13 years 10 months ago
Bayesian source separation: beyond PCA and ICA
Blind source separation (BSS) has become one of the major signal and image processing area in many applications. Principal component analysis (PCA) and Independent component analys...
Ali Mohammad-Djafari
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 8 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
14 years 5 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
SCHEDULING
2008
67views more  SCHEDULING 2008»
13 years 8 months ago
Exact train pathing
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
Viswanath Nagarajan, Abhiram G. Ranade
ICML
2006
IEEE
14 years 9 months ago
Deterministic annealing for semi-supervised kernel machines
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...