Sciweavers

58 search results - page 11 / 12
» Relating Equivalence and Reducibility to Sparse Sets
Sort
View
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 5 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, ...
ICML
2007
IEEE
14 years 8 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
INFOCOM
2006
IEEE
14 years 1 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
JCT
2007
140views more  JCT 2007»
13 years 7 months ago
Homomorphisms and edge-colourings of planar graphs
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
Reza Naserasr
LICS
2006
IEEE
14 years 1 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong