Sciweavers

1695 search results - page 246 / 339
» Linear, Polynomial or Exponential
Sort
View
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
15 years 9 months ago
Approximating the Bandwidth of Caterpillars
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Uriel Feige, Kunal Talwar
WILF
2005
Springer
185views Fuzzy Logic» more  WILF 2005»
15 years 9 months ago
SVM Classification of Neonatal Facial Images of Pain
This paper reports experiments that explore performance differences in two previous studies that investigated SVM classification of neonatal pain expressions using the Infant COPE ...
Sheryl Brahnam, Chao-Fa Chuang, Frank Y. Shih, Mel...
FOCS
2002
IEEE
15 years 9 months ago
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
Andrej Bogdanov, Kenji Obata, Luca Trevisan
CDC
2009
IEEE
184views Control Systems» more  CDC 2009»
15 years 9 months ago
Controllability and observability of uncertain systems: A robust measure
— This paper deals with the class of polynomially uncertain continuous-time linear time-invariant (LTI) systems whose uncertainties belong to a semi-algebraic set. The objective ...
Somayeh Sojoudi, Javad Lavaei, Amir G. Aghdam
WINE
2009
Springer
147views Economy» more  WINE 2009»
15 years 8 months ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta