Sciweavers

2181 search results - page 73 / 437
» The restriction scaffold problem
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Detecting statistical interactions with additive groves of trees
Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-d...
Daria Sorokina, Rich Caruana, Mirek Riedewald, Dan...
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 8 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
MP
2011
13 years 3 months ago
Lifting for conic mixed-integer programming
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very eï¬...
Alper Atamtürk, Vishnu Narayanan
JMLR
2010
111views more  JMLR 2010»
13 years 3 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...
JUCS
2010
130views more  JUCS 2010»
13 years 7 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han