3244 search results - page 288 / 649 » On convex complexity measures |
167
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
180
click to vote
AINA
2009
IEEE
16 years 1 months ago
2009
IEEE
When designing a complex system such as a sensornet it is not always practical to build and deploy a realistically sized prototype. At the same time many of the interesting behavi...
191
click to vote
ACAL
2009
Springer
16 years 1 months ago
2009
Springer
The Information Fusion Panel within The Technical Cooperation Program (TTCP) is developing algorithms to perform machine-based situation assessment to assist human operators in co...
190
click to vote
SAGA
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
191
click to vote
INTERACTION
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...