Sciweavers

943 search results - page 137 / 189
» How should data structures and algorithms be taught
Sort
View
SAC
2008
ACM
13 years 7 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
SIGGRAPH
1996
ACM
14 years 6 days ago
Rendering Parametric Surfaces in Pen and Ink
This paper presents new algorithms and techniques for rendering parametric free-form surfaces in pen and ink. In particular, we introduce the idea of "controlled-density hatc...
Georges Winkenbach, David Salesin
POPL
2003
ACM
14 years 8 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
WICON
2008
13 years 9 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu
SIGMOD
2005
ACM
119views Database» more  SIGMOD 2005»
14 years 8 months ago
DogmatiX Tracks down Duplicates in XML
Duplicate detection is the problem of detecting different entries in a data source representing the same real-world entity. While research abounds in the realm of duplicate detect...
Melanie Weis, Felix Naumann