Sciweavers

1101 search results - page 78 / 221
» heuristics 2007
Sort
View
ICIAP
2007
ACM
14 years 1 months ago
Parsing Silhouettes without Boundary Curvature
We describe a new decomposition algorithm for twodimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by group...
Ralf Juengling, Lakshman Prasad
FUN
2007
Springer
82views Algorithms» more  FUN 2007»
14 years 1 months ago
The Worst Page-Replacement Policy
In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of mi...
Kunal Agrawal, Michael A. Bender, Jeremy T. Finema...
ICMCS
2007
IEEE
136views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Minimum-Multiplicity Routing Problems of Multimedia Communications
In this work, we investigate the routing problems ofminimizing the number ofdistinct transmission mediums or carrier domains for multimedia communications. We consider the problem...
Shengli Yuan
COMSWARE
2007
IEEE
14 years 4 months ago
On Optimal Performance in Mobile Ad hoc Networks
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
Tapas K. Patra, Joy Kuri, Pavan Nuggehalli
EMNLP
2008
13 years 11 months ago
Phrase Translation Probabilities with ITG Priors and Smoothing as Learning Objective
The conditional phrase translation probabilities constitute the principal components of phrase-based machine translation systems. These probabilities are estimated using a heurist...
Markos Mylonakis, Khalil Sima'an