Sciweavers

388 search results - page 30 / 78
» Improving Exact Algorithms for MAX-2-SAT
Sort
View
AOR
2007
107views more  AOR 2007»
13 years 7 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
ICML
2006
IEEE
14 years 8 months ago
Semi-supervised nonlinear dimensionality reduction
The problem of nonlinear dimensionality reduction is considered. We focus on problems where prior information is available, namely, semi-supervised dimensionality reduction. It is...
Xin Yang, Haoying Fu, Hongyuan Zha, Jesse L. Barlo...
ALGORITHMICA
2011
13 years 2 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
INFOCOM
2012
IEEE
11 years 10 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
EMNLP
2008
13 years 9 months ago
Lattice-based Minimum Error Rate Training for Statistical Machine Translation
Minimum Error Rate Training (MERT) is an effective means to estimate the feature function weights of a linear model such that an automated evaluation criterion for measuring syste...
Wolfgang Macherey, Franz Josef Och, Ignacio Thayer...