Sciweavers

2040 search results - page 353 / 408
» On the Complexity of Error Explanation
Sort
View
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 5 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
CHI
2007
ACM
16 years 5 months ago
Meta-analysis of correlations among usability measures
Understanding the relation between usability measures seems crucial to deepen our conception of usability and to select the right measures for usability studies. We present a meta...
Kasper Hornbæk, Effie Lai-Chong Law
POPL
2003
ACM
16 years 5 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
ICALP
2009
Springer
16 years 4 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
16 years 4 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...