Sciweavers

453 search results - page 85 / 91
» Tight bounds for the partial-sums problem
Sort
View
MP
2010
128views more  MP 2010»
13 years 5 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
TIT
2010
110views Education» more  TIT 2010»
13 years 2 months ago
Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...
Sergey Loyka, Victoria Kostina, François Ga...
WSNA
2003
ACM
14 years 18 days ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
COMPGEOM
2005
ACM
13 years 9 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 1 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer