Sciweavers

288 search results - page 8 / 58
» random 1998
Sort
View
IPPS
1998
IEEE
15 years 2 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
65
Voted
AIPS
1998
14 years 11 months ago
Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems
Westudytheruntimeprofilesofcompletebacktrackstylesearchmethodsappliedtohardschedulingproblems.Suchsearchmethodsoftenexhibita largevariabilityinperformanceduetothenon-standardnatur...
Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tr...
VDB
1998
117views Database» more  VDB 1998»
14 years 11 months ago
Textural Features and Relevance Feedback for Image Retrieval
This paper focuses on the retrieval of complex images based on their textural content. We use GMRF for texture discrimination and a region-growing algorithm for texture segmentati...
Eugenio Di Sciascio, Giacomo Piscitelli, Augusto C...
100
Voted
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
14 years 11 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
IPPS
1998
IEEE
15 years 2 months ago
A Survey of Randomness and Parallelism in Comparison Problems
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
Danny Krizanc