Sciweavers

1568 search results - page 296 / 314
» The problem of examination questions in algorithmics
Sort
View
BMCBI
2007
129views more  BMCBI 2007»
13 years 11 months ago
Algebraic correction methods for computational assessment of clone overlaps in DNA fingerprint mapping
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
Michael C. Wendl
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
14 years 7 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...
P2P
2008
IEEE
14 years 5 months ago
Peer-to-Peer Secure Multi-party Numerical Computation
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
Danny Bickson, Danny Dolev, Genia Bezman, Benny Pi...
SIGIR
2006
ACM
14 years 4 months ago
You are what you say: privacy risks of public mentions
In today’s data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinion...
Dan Frankowski, Dan Cosley, Shilad Sen, Loren G. T...
VLDB
2005
ACM
180views Database» more  VLDB 2005»
14 years 4 months ago
Cache-conscious Frequent Pattern Mining on a Modern Processor
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasa...