Sciweavers

280 search results - page 44 / 56
» Termination Tools in Ordered Completion
Sort
View
LREC
2008
117views Education» more  LREC 2008»
13 years 11 months ago
Evolutionary Basic Notions for a Thematic Representation of General Knowledge
In the field of Natural Language Processing, in order to work out a thematic representation system of general knowledge, methods relying on thesaurus have been used for about twen...
Alain Joubert, Mathieu Lafourcade
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 11 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
JOT
2007
102views more  JOT 2007»
13 years 9 months ago
Type Access Analysis: Towards Informed Interface Design
Programs designed from scratch often start with just a set of classes. Classes can be instantiated and so deliver the objects that are the carriers of information and function. In...
Friedrich Steimann, Philip Mayer
PAMI
2007
176views more  PAMI 2007»
13 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
RSA
2008
103views more  RSA 2008»
13 years 9 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav