Sciweavers

51 search results - page 5 / 11
» A Search Algorithm for Latent Variable Models with Unbounded...
Sort
View
CAV
2010
Springer
239views Hardware» more  CAV 2010»
13 years 11 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
WSDM
2010
ACM
322views Data Mining» more  WSDM 2010»
14 years 5 months ago
Inferring Search Behaviors Using Partially Observable Markov (POM) Model
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
Kuansan Wang, Nikolas Gloy, Xiaolong Li
ECAI
2006
Springer
13 years 11 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
CVPR
2012
IEEE
11 years 10 months ago
Top-down visual saliency via joint CRF and dictionary learning
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
Jimei Yang, Ming-Hsuan Yang