Sciweavers

1168 search results - page 40 / 234
» cases 2000
Sort
View
ISAAC
2000
Springer
100views Algorithms» more  ISAAC 2000»
13 years 11 months ago
An Improved Algorithm for Subdivision Traversal without Extra Storage
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...
Prosenjit Bose, Pat Morin
ANLP
2000
91views more  ANLP 2000»
13 years 9 months ago
Finite-State Reduplication in One-Level Prosodic Morphology
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a pho...
Markus Walther
ROOM
2000
13 years 9 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark
COMBINATORICS
2000
78views more  COMBINATORICS 2000»
13 years 7 months ago
Two New Extensions of the Hales-Jewett Theorem
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
Randall McCutcheon
DEXAW
2000
IEEE
112views Database» more  DEXAW 2000»
13 years 12 months ago
An Experiment in Discovering Association Rules in the Legal Domain
In this paper we explore the applicability of an algorithm designed for finding association rules in large databases to the discovery of relevant associations from a large case ba...
Trevor J. M. Bench-Capon, Frans Coenen, Paul H. Le...