3134 search results - page 330 / 627 » Computing full disjunctions |
81
Voted
WWW
2006
ACM
16 years 1 months ago
2006
ACM
Fitting enough information from webpages to make browsing on small screens compelling is a challenging task. One approach is to present the user with a thumbnail image of the full...
104
Voted
CHES
2009
Springer
16 years 1 months ago
2009
Springer
Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defea...
130
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
118
Voted
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, a new logic synthesis method for an AND-XOR-OR type sense-amplifying PLA is proposed. An AND-XOR-OR type sense-amplifying PLA can achieve lowpower dissipation and h...
116
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...