77 search results - page 5 / 16 » Optimizing over the split closure |
MOBICOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider the problem of efficient link-layer multicasting in wireless networks with switched beamforming antennas. The inherent tradeoff between multicasting and beamforming ...
CORR
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
POPL
1996
ACM
14 years 1 months ago
1996
ACM
operators. The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator. These operators are used to regulate the sp...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...