Sciweavers

2754 search results - page 364 / 551
» Distributed Weighted Matching
Sort
View
MP
2006
138views more  MP 2006»
15 years 3 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
PAMI
2008
146views more  PAMI 2008»
15 years 3 months ago
Video Event Recognition Using Kernel Methods with Multilevel Temporal Alignment
In this work, we systematically study the problem of event recognition in unconstrained news video sequences. We adopt the discriminative kernel-based method for which video clip s...
Dong Xu, Shih-Fu Chang
PR
2007
141views more  PR 2007»
15 years 3 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
163
Voted
SAT
2010
Springer
172views Hardware» more  SAT 2010»
15 years 2 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
SIAMSC
2010
142views more  SIAMSC 2010»
14 years 10 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...