Sciweavers

1644 search results - page 36 / 329
» Finding Dominators in Practice
Sort
View
ASPLOS
2010
ACM
14 years 3 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
ICFP
2009
ACM
14 years 3 months ago
Finding race conditions in Erlang with QuickCheck and PULSE
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard t...
Koen Claessen, Michal Palka, Nicholas Smallbone, J...
BMCV
2000
Springer
14 years 1 months ago
A New Line Segment Grouping Method for Finding Globally Optimal Line Segments
In this paper we propose a new method for extracting line segments from edge images. Our method basically follows a line segment grouping approach. This approach has many advantage...
Jeong-Hun Jang, Ki-Sang Hong
COMPGEOM
1990
ACM
14 years 23 days ago
Finding Compact Coordinate Representations for Polygons and Polyhedra
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
Victor Milenkovic, Lee R. Nackman
ICCAD
2007
IEEE
234views Hardware» more  ICCAD 2007»
14 years 17 days ago
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon ...