Sciweavers

3055 search results - page 119 / 611
» Randomized Search Trees
Sort
View
ESTIMEDIA
2009
Springer
14 years 5 months ago
System-level MP-SoC design space exploration using tree visualization
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...
Toktam Taghavi, Andy D. Pimentel, Mark Thompson
AVI
2006
13 years 11 months ago
Navigation in degree of interest trees
We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users...
Raluca Budiu, Peter Pirolli, Michael Fleetwood
ICIP
2009
IEEE
14 years 9 months ago
A Markov Random Field Model for Extracting Near-Circular Shapes
We propose a binary Markov Random Field (MRF) model that assigns high probability to regions in the image domain consisting of an unknown number of circles of a given radius. We...
Tamas Blaskovics, Zoltan Kato, and Ian Jermyn
SSDBM
1990
IEEE
94views Database» more  SSDBM 1990»
14 years 2 months ago
Random Sampling from Database Files: A Survey
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...
Frank Olken, Doron Rotem
ANOR
2004
116views more  ANOR 2004»
13 years 10 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys