Sciweavers

1095 search results - page 25 / 219
» Preprocessing of Intractable Problems
Sort
View
EMNLP
2006
13 years 9 months ago
Incremental Integer Linear Programming for Non-projective Dependency Parsing
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
Sebastian Riedel, James Clarke
IJISEC
2006
108views more  IJISEC 2006»
13 years 7 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn
COR
2007
105views more  COR 2007»
13 years 7 months ago
Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances ofthemultiple-depotvehicleschedulingproblem(MDVSP).Howeverdif...
Amar Oukil, Hatem Ben Amor, Jacques Desrosiers, Hi...
ECCC
2002
86views more  ECCC 2002»
13 years 7 months ago
Classical Physics and the Church-Turing Thesis
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...
Andrew Chi-Chih Yao