Sciweavers

1541 search results - page 230 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 8 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
CAIP
2009
Springer
202views Image Analysis» more  CAIP 2009»
13 years 6 months ago
Near-Regular Texture Synthesis
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...
Michal Haindl, Martin Hatka
BMCBI
2002
136views more  BMCBI 2002»
13 years 8 months ago
Making sense of EST sequences by CLOBBing them
Background: Expressed sequence tags (ESTs) are single pass reads from randomly selected cDNA clones. They provide a highly cost-effective method to access and identify expressed g...
John Parkinson, David B. Guiliano, Mark L. Blaxter
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 1 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
FSTTCS
2000
Springer
13 years 11 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen