6110 search results - page 138 / 1222 » Approximate Computing |
182
click to vote
CMSB
2009
Springer
16 years 1 months ago
2009
Springer
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
179
click to vote
ADHOCNOW
2008
Springer
16 years 23 days ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
188
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
168
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...
168
click to vote
SMILE
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we explore the more practical aspects of building and rendering concentric mosaics. First, we use images captured with only approximately circular camera trajectorie...