Sciweavers

3204 search results - page 456 / 641
» The Alcuin Number of a Graph
Sort
View
IPL
2006
97views more  IPL 2006»
15 years 7 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
JCP
2006
102views more  JCP 2006»
15 years 7 months ago
Efficient Formulations for 1-SVM and their Application to Recommendation Tasks
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
Yasutoshi Yajima, Tien-Fang Kuo
JUCS
2006
87views more  JUCS 2006»
15 years 7 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
NETWORKS
2008
15 years 7 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
PAMI
2006
440views more  PAMI 2006»
15 years 7 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady