Sciweavers

4047 search results - page 749 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
TIP
2010
161views more  TIP 2010»
14 years 11 months ago
Automatic Parameter Selection for Denoising Algorithms Using a No-Reference Measure of Image Content
Across the field of inverse problems in image and video processing, nearly all algorithms have various parameters which need to be set in order to yield good results. In practice, ...
Xiang Zhu, Peyman Milanfar
RECOMB
2008
Springer
16 years 4 months ago
Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony
Understanding the variation of recombination rates across a given genome is crucial for disease gene mapping and for detecting signatures of selection, to name just a couple of app...
Jotun Hein, Rune B. Lyngsø, Yun S. Song
132
Voted
SASO
2008
IEEE
15 years 10 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
151
Voted
CP
2003
Springer
15 years 9 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
127
Voted
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 8 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie