6393 search results - page 384 / 1279 » Randomized Algorithms on the Mesh |
169
Voted
DAC
1995
ACM
15 years 10 months ago
1995
ACM
—DARWIN is a tool that is able to synthesize CMOS opamps, on the basis of a genetic algorithm. A randomly generated initial set of opamps evolves to a set in which the topologies...
211
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
170
click to vote
ICDT
2005
ACM
16 years 8 days ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
337
click to vote
Source Code
This is the sample implementation of a Markov random field based image segmentation algorithm described in the following papers:
1. Mark Berthod, Zoltan Kato, Shan Yu, and Josi...
208
click to vote
CVPR
2009
IEEE
16 years 1 months ago
2009
IEEE
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...