927 search results - page 15 / 186 » A Data Abstraction Alternative to Data Structure Algorithm M... |
ENTCS
2008
13 years 7 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
NIPS
2008
13 years 8 months ago
2008
In this paper, we address the question of what kind of knowledge is generally transferable from unlabeled text. We suggest and analyze the semantic correlation of words as a gener...
SSPR
2004
Springer
14 years 22 days ago
2004
Springer
Kernel Methods are a class of algorithms for pattern analysis with a number of convenient features. They can deal in a uniform way with a multitude of data types and can be used to...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
WADS
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...