110 search results - page 9 / 22 » Patterson-Wiedemann construction revisited |
86
Voted
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
ANOR
2007
14 years 9 months ago
2007
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
76
Voted
TCS
2008
14 years 9 months ago
2008
F. Labelle and J. Shewchuk [3] have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the...
99
Voted
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...