Sciweavers

2976 search results - page 374 / 596
» On the bounded integer programming
Sort
View
VIS
2006
IEEE
122views Visualization» more  VIS 2006»
16 years 5 months ago
Representing Higher-Order Singularities in Vector Fields on Piecewise Linear Surfaces
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...
Wan-Chiu Li, Bruno Vallet, Nicolas Ray, Bruno L...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 1 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
FOCS
2009
IEEE
15 years 11 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
FOCS
2009
IEEE
15 years 11 months ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff
COCOA
2007
Springer
15 years 10 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...