Sciweavers

106 search results - page 20 / 22
» Two Element Unavoidable Sets of Partial Words
Sort
View
KCAP
2011
ACM
12 years 11 months ago
Eliciting hierarchical structures from enumerative structures for ontology learning
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
Mouna Kamel, Bernard Rothenburger
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
14 years 19 days ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
RTA
2010
Springer
14 years 13 days ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
MP
1998
105views more  MP 1998»
13 years 8 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
KDD
2006
ACM
240views Data Mining» more  KDD 2006»
14 years 9 months ago
Adaptive event detection with time-varying poisson processes
Time-series of count data are generated in many different contexts, such as web access logging, freeway traffic monitoring, and security logs associated with buildings. Since this...
Alexander T. Ihler, Jon Hutchins, Padhraic Smyth