Sciweavers

344 search results - page 22 / 69
» The Directed Minimum Latency Problem
Sort
View
COMCOM
2008
124views more  COMCOM 2008»
14 years 9 months ago
Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good desig...
Meng-Shiuan Pan, Yu-Chee Tseng
FOCS
2003
IEEE
15 years 2 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
ACL
2006
14 years 11 months ago
Minimum Risk Annealing for Training Log-Linear Models
When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural languag...
David A. Smith, Jason Eisner
ICCCN
2008
IEEE
15 years 4 months ago
Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity
—The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues t...
Muhammad S. Javed, Krishnaiyan Thulasiraman, Guoli...
ECCV
2010
Springer
15 years 2 months ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...