Sciweavers

2080 search results - page 175 / 416
» Measuring empirical computational complexity
Sort
View
TKDE
2008
128views more  TKDE 2008»
15 years 4 months ago
Mixed-Drove Spatiotemporal Co-Occurrence Pattern Mining
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
Mete Celik, Shashi Shekhar, James P. Rogers, James...
ISBI
2011
IEEE
14 years 8 months ago
Sparse topological data recovery in medical images
For medical image analysis, the test statistic of the measurements is usually constructed at every voxels in space and thresholded to determine the regions of significant signals...
Moo K. Chung, Hyekyoung Lee, Peter T. Kim, Jong Ch...
STACS
2010
Springer
15 years 12 months ago
Inseparability and Strong Hypotheses for Disjoint NP Pairs
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...
Lance Fortnow, Jack H. Lutz, Elvira Mayordomo
159
Voted
SAGA
2009
Springer
15 years 11 months ago
Scenario Reduction Techniques in Stochastic Programming
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
Werner Römisch
CVDB
2004
ACM
15 years 10 months ago
A Multimedia Data Base Browsing System
Browsing large multimedia databases is becoming a challenging problem, due to the availability of great amounts of data and the complexity of retrieval. In this paper we propose a...
Massimiliano Albanese, Carmine Cesarano, Antonio P...