Sciweavers

2479 search results - page 371 / 496
» Random Event Structures
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
14 years 2 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
AUSAI
2007
Springer
14 years 2 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
ACIVS
2007
Springer
14 years 2 months ago
Joint Domain-Range Modeling of Dynamic Scenes with Adaptive Kernel Bandwidth
Abstract. The first step in various computer vision applications is a detection of moving objects. The prevalent pixel-wise models regard image pixels as independent random process...
Borislav Antic, Vladimir S. Crnojevic
ECCV
2010
Springer
14 years 2 months ago
Exploiting Repetitive Object Patterns for Model Compression and Completion
Many man-made and natural structures consist of similar elements arranged in regular patterns. In this paper we present an unsupervised approach for discovering and reasoning on re...
ICASSP
2007
IEEE
14 years 2 months ago
Texture Classification by using Advanced Local Binary Patterns and Spatial Distribution of Dominant Patterns
In this paper, we propose a new feature extraction method, which is robust against rotation and histogram equalization for texture classification. To this end, we introduce the co...
Shu Liao, Albert C. S. Chung