4965 search results - page 113 / 993 » A Simple Abstraction for Data Modeling |
186
click to vote
ESANN
2008
15 years 7 months ago
2008
Abstract. We consider the problem of learning an unknown (overcomplete) basis from an unknown sparse linear combination. Introducing the "sparse coding neural gas" algori...
167
click to vote
DAWAK
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
213
click to vote
ASIAN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
167
click to vote
SCAM
2006
IEEE
16 years 11 days ago
2006
IEEE
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
PODC
1987
ACM
15 years 9 months ago
1987
ACM
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...