Sciweavers

2314 search results - page 296 / 463
» Minimal Partitions of a Graph
Sort
View
JAL
2006
175views more  JAL 2006»
15 years 4 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin
DLIB
2002
263views more  DLIB 2002»
15 years 3 months ago
Information Retrieval by Semantic Analysis and Visualization of the Concept Space of D-Lib Magazine
In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary gene...
Junliang Zhang, Javed Mostafa, Himansu Tripathy
NETWORKS
2010
15 years 2 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
CASES
2006
ACM
15 years 10 months ago
Extensible control architectures
Architectural advances of modern systems has often been at odds with control complexity, requiring significant effort in both design and verification. This is particularly true ...
Greg Hoover, Forrest Brewer, Timothy Sherwood
ICCV
2009
IEEE
16 years 7 months ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter