149 search results - page 28 / 30 » Crossing Numbers and Parameterized Complexity |
GMP
2002
IEEE
14 years 12 days ago
2002
IEEE
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
ICALP
2003
Springer
14 years 20 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
SPRINGSIM
2007
13 years 8 months ago
2007
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...
ICRA
2003
IEEE
14 years 22 days ago
2003
IEEE
− To facilitate training and planning for medical procedures such as prostate brachytherapy, we are developing an interactive simulation of needle insertion and radioactive seed ...