Sciweavers

784 search results - page 24 / 157
» Relaxing the Value Restriction
Sort
View
MP
2006
121views more  MP 2006»
13 years 10 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg
ACL
2010
13 years 8 months ago
Better Filtration and Augmentation for Hierarchical Phrase-Based Translation Rules
This paper presents a novel filtration criteria to restrict the rule extraction for the hierarchical phrase-based translation model, where a bilingual but relaxed well-formed depe...
Zhiyang Wang, Yajuan Lv, Qun Liu, Young-Sook Hwang
MPC
2010
Springer
152views Mathematics» more  MPC 2010»
14 years 2 months ago
Lucy-n: a n-Synchronous Extension of Lustre
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
Louis Mandel, Florence Plateau, Marc Pouzet
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 2 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
RSFDGRC
1999
Springer
194views Data Mining» more  RSFDGRC 1999»
14 years 2 months ago
A Closest Fit Approach to Missing Attribute VAlues in Preterm Birth Data
: In real-life data, in general, many attribute values are missing. Therefore, rule induction requires preprocessing, where missing attribute values are replaced by appropriate val...
Jerzy W. Grzymala-Busse, Witold J. Grzymala-Busse,...