Sciweavers

523 search results - page 29 / 105
» Graph-Based Induction for General Graph Structured Data
Sort
View
ICFP
2005
ACM
15 years 9 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
IJCAI
1997
14 years 11 months ago
On the Efficient Classification of Data Structures by Neural Networks
Marco Gori Dipartimento di Ingegneria deU'Informazione Universita di Siena Via Roma 56 53100 Siena, Italy Alessandro Sperduti Dipartimento di Informatica Universita di Pisa C...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 3 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
73
Voted
SIGCSE
2004
ACM
110views Education» more  SIGCSE 2004»
15 years 3 months ago
An extensible framework for providing dynamic data structure visualizations in a lightweight IDE
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
T. Dean Hendrix, James H. Cross II, Larry A. Barow...
PODC
2004
ACM
15 years 3 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...