3780 search results - page 318 / 756 » Structured Relation Discovery using Generative Models |
158
Voted
CN
2004
15 years 6 months ago
2004
A number of web cache-related algorithms, such as replacement and prefetching policies, rely on specific characteristics present in the sequence of requests for efficient performa...
166
click to vote
JLP
2007
15 years 6 months ago
2007
This paper is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow a recent theory by the same authors and previously applied to the...
201
click to vote
SAT
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
154
click to vote
ISCA
2000
IEEE
15 years 11 months ago
2000
IEEE
As DRAM access latencies approach a thousand instructionexecution times and on-chip caches grow to multiple megabytes, it is not clear that conventional cache structures continue ...
164
click to vote
NIPS
1998
15 years 8 months ago
1998
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...