1568 search results - page 296 / 314 » The problem of examination questions in algorithmics |
152
click to vote
BMCBI
2007
15 years 5 months ago
2007
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...
161
click to vote
ICCAD
2006
IEEE
16 years 2 months ago
2006
IEEE
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...
168
click to vote
P2P
2008
IEEE
15 years 12 months ago
2008
IEEE
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...
159
click to vote
SIGIR
2006
ACM
15 years 11 months ago
2006
ACM
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...
175
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
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...