Sciweavers

943 search results - page 117 / 189
» How should data structures and algorithms be taught
Sort
View
SIGSOFT
2010
ACM
15 years 12 days ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
GIS
1995
ACM
15 years 6 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
139
Voted
DLS
2008
149views Languages» more  DLS 2008»
15 years 4 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
ML
1998
ACM
139views Machine Learning» more  ML 1998»
15 years 2 months ago
The Hierarchical Hidden Markov Model: Analysis and Applications
We introduce, analyze and demonstrate a recursive hierarchical generalization of the widely used hidden Markov models, which we name Hierarchical Hidden Markov Models (HHMM). Our m...
Shai Fine, Yoram Singer, Naftali Tishby
APCCM
2009
15 years 3 months ago
Modeling Natural Language Communication in Database Semantics
Database Semantics (DBS) is a computational model of how communicating with natural language works. at a level of abstraction which may be applied to natural and artificial agents...
Roland Hausser