Sciweavers

3049 search results - page 556 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
AAAI
2008
13 years 11 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 10 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen
OPODIS
2004
13 years 10 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
VMV
2003
181views Visualization» more  VMV 2003»
13 years 10 months ago
2.5D Active Contour for Surface Reconstruction
In this paper, we present a new deformable model — 2.5D Active Contour— that is capable of directly extracting shape geometry from 3D unorganized point cloud datasets. The rec...
Ye Duan, Hong Qin
DAM
2006
132views more  DAM 2006»
13 years 8 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler