Sciweavers

432 search results - page 43 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
AINA
2005
IEEE
14 years 1 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
ICRA
2003
IEEE
120views Robotics» more  ICRA 2003»
14 years 27 days ago
Extracting optimal paths from roadmaps for motion planning
We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/...
Jinsuck Kim, Roger A. Pearce, Nancy M. Amato
NIPS
2004
13 years 9 months ago
Semi-supervised Learning by Entropy Minimization
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regulariza...
Yves Grandvalet, Yoshua Bengio
DAM
2008
108views more  DAM 2008»
13 years 7 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
Cédric Bentz
JCT
2006
82views more  JCT 2006»
13 years 7 months ago
A symmetric Roos bound for linear codes
The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of...
Iwan M. Duursma, Ruud Pellikaan