190 search results - page 20 / 38 » Exponential Propagation for Set Variables |
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
FOCS
2002
IEEE
14 years 17 days ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
AAAI
2010
13 years 9 months ago
2010
The current methods used to mine and analyze temporal social network data make two assumptions: all edges have the same strength, and all parameters are time-homogeneous. We show ...