Sciweavers

715 search results - page 133 / 143
» Second step algorithms in the Burrows-Wheeler compression al...
Sort
View
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
14 years 25 days ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
ASPLOS
2009
ACM
13 years 11 months ago
Accelerating phase unwrapping and affine transformations for optical quadrature microscopy using CUDA
Optical Quadrature Microscopy (OQM) is a process which uses phase data to capture information about the sample being studied. OQM is part of an imaging framework developed by the ...
Perhaad Mistry, Sherman Braganza, David R. Kaeli, ...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 8 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
14 years 7 months ago
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web
When automatically extracting information from the world wide web, most established methods focus on spotting single HTMLdocuments. However, the problem of spotting complete web s...
Martin Ester, Hans-Peter Kriegel, Matthias Schuber...
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
14 years 4 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...