2239 search results - page 169 / 448 » Computing with abstract matrix structures |
151
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
141
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
117
click to vote
WADT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
121
Voted
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
129
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...