Sciweavers

903 search results - page 26 / 181
» Non-well-founded trees in categories
Sort
View
KBSE
2007
IEEE
15 years 6 months ago
Test suite reduction and prioritization with call trees
This paper presents a tool that (i) constructs tree-based models of a program’s behavior during testing and (ii) employs these trees while reordering and reducing a test suite. ...
Adam M. Smith, Joshua Geiger, Gregory M. Kapfhamme...
WWW
2010
ACM
15 years 3 months ago
Hierarchical cluster visualization in web mapping systems
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
Jean-Yves Delort
ACMSE
2008
ACM
15 years 1 months ago
Mining frequent sequential patterns with first-occurrence forests
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
Erich Allen Peterson, Peiyi Tang
EMNLP
2008
15 years 1 months ago
Sparse Multi-Scale Grammars for Discriminative Latent Variable Parsing
We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF gramm...
Slav Petrov, Dan Klein
UAI
2004
15 years 1 months ago
MOB-ESP and other Improvements in Probability Estimation
A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probabi...
Rodney Nielsen