Sciweavers

221 search results - page 31 / 45
» Efficient sampling of random permutations
Sort
View
ICALP
2009
Springer
14 years 8 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
PVLDB
2008
138views more  PVLDB 2008»
13 years 7 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
13 years 12 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
JMLR
2010
165views more  JMLR 2010»
13 years 2 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
TITB
2010
151views Education» more  TITB 2010»
13 years 2 months ago
An adaptive Monte Carlo approach to phase-based multimodal image registration
In this paper, a novel multiresolution algorithm for registering multimodal images, using an adaptive Monte Carlo scheme is presented. At each iteration, random solution candidates...
Alexander Wong