Sciweavers

1949 search results - page 134 / 390
» Random graphs on surfaces
Sort
View
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 10 months ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...
AOSD
2007
ACM
15 years 8 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
JSAC
2008
98views more  JSAC 2008»
15 years 4 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
PAMI
2010
207views more  PAMI 2010»
14 years 11 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
UIST
1995
ACM
15 years 8 months ago
3-Dimensional Pliable Surfaces: For the Effective Presentation of Visual Information
A fundamental issue in user interface design is the effective use of available screen space, commonly referred to as the screen real estate problem. This paper presents a new dist...
M. Sheelagh T. Carpendale, David J. Cowperthwaite,...