Sciweavers

2835 search results - page 191 / 567
» Automatic Question Answering
Sort
View
DM
2006
76views more  DM 2006»
15 years 4 months ago
Lex M versus MCS-M
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
Yngve Villanger
DM
2006
68views more  DM 2006»
15 years 4 months ago
A note on maximally repeated sub-patterns of a point set
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
Véronique Cortier, Xavier Goaoc, Mira Lee, ...
ISSE
2006
15 years 4 months ago
Pattern Componentization: The Factory Example
Can Design Patterns be turned into reusable components? To help answer this question, we have performed a systematic study of the standard design patterns. One of the most ing is ...
Karine Arnout, Bertrand Meyer
DAM
2007
129views more  DAM 2007»
15 years 4 months ago
Easy and hard instances of arc ranking in directed graphs
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Dariusz Dereniowski
129
Voted
DCG
2007
76views more  DCG 2007»
15 years 4 months ago
Packing Cones and Their Negatives in Space
Let C be a cone in R3 whose base B is a planar convex body in a horizontal plane π and whose tip is a point v /∈ π. Let C be a packing formed by translates of C and −C in R3...
Imre Bárány, Jirí Matousek