1517 search results - page 262 / 304 » New Approach To A Class Of Matrices |
155
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
118
Voted
WWW
2005
ACM
16 years 2 months ago
2005
ACM
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
112
click to vote
HPCA
2007
IEEE
16 years 1 months ago
2007
IEEE
Memory bugs are a broad class of bugs that is becoming increasingly common with increasing software complexity, and many of these bugs are also security vulnerabilities. Unfortuna...
146
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
123
click to vote
EMSOFT
2005
Springer
15 years 7 months ago
2005
Springer
Early applications of smart cards have focused in the area of personal security. Recently, there has been an increasing demand for networked, multi-application cards. In this new ...