Sciweavers

1242 search results - page 207 / 249
» The Theory of Grammar Constraints
Sort
View
COMPGEOM
2008
ACM
15 years 2 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
119
Voted
DIAGRAMS
2008
Springer
15 years 2 months ago
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
Aidan Delaney, John Taylor, Simon J. Thompson
100
Voted
EMSOFT
2008
Springer
15 years 2 months ago
Disassembling real-time fault-tolerant programs
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Anish Ar...
ACL
2007
15 years 2 months ago
Making Lexical Ontologies Functional and Context-Sensitive
Human categorization is neither a binary nor a context-free process. Rather, some concepts are better examples of a category than others, while the criteria for category membershi...
Tony Veale, Yanfen Hao
109
Voted
IJCAI
2007
15 years 2 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos