Sciweavers

1919 search results - page 148 / 384
» Recent Extensions to Traviando
Sort
View
FSTTCS
2008
Springer
15 years 5 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
ICML
2010
IEEE
15 years 5 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
HPCC
2010
Springer
15 years 4 months ago
A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
Carlos H. Gonzalez, Basilio B. Fraguela
ACTA
2007
85views more  ACTA 2007»
15 years 4 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
AUTOMATICA
2010
90views more  AUTOMATICA 2010»
15 years 4 months ago
A line search improvement of efficient MPC
A recent lifting technique led to a computationally efficient Model Predictive Control (MPC) strategy in which the online optimization is performed using a univariate Newton-Raphs...
Basil Kouvaritakis, Shuang Li, Mark Cannon