Sciweavers

725 search results - page 45 / 145
» Descriptive Set Theory of Families of Small Sets
Sort
View
LATA
2009
Springer
15 years 4 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle
ACL
2010
14 years 7 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
OOPSLA
2005
Springer
15 years 3 months ago
GOOAL: an educational object oriented analysis laboratory
Our goal is to enable rapid production of static and dynamic object models from natural language description of problems. Rapid modeling is achieved through automation of analysis...
Hector G. Pérez-González, Jugal K. K...
SAINT
2005
IEEE
15 years 3 months ago
A Framework of Numerical Basket Analysis
Basket Analysis is mathematically characterized and extended to search families of sets in this paper. These theories indicate the possibility of various new approaches of data mi...
Takashi Washio, Atsushi Fujimoto, Hiroshi Motoda
COMPGEOM
2005
ACM
14 years 11 months ago
Hadwiger and Helly-type theorems for disjoint unit spheres in R3
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen