5105 search results - page 816 / 1021 » Approximate Structural Consistency |
226
click to vote
TPCD
1994
15 years 7 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
185
click to vote
USENIX
1990
15 years 7 months ago
1990
This paper describes a new model for constructing distributed systems called the Remote Memory Model. The remote memory model consists of several client machines, one or more dedi...
176
click to vote
BIS
2009
15 years 7 months ago
2009
Knowledge-based applications are characterized by their use of machine-understandable formalizations of expert knowledge. Complex knowledge structures, and the features which explo...
199
click to vote
DAWAK
2010
Springer
15 years 7 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
223
click to vote
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Desktop search is an important part of personal information management (PIM). However, research in this area has been limited by the lack of shareable test collections, making cum...