Sciweavers

2168 search results - page 53 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 2 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
JUCS
2007
108views more  JUCS 2007»
13 years 8 months ago
On Pipelining Sequences of Data-Dependent Loops
: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually ...
Rui Rodrigues, João M. P. Cardoso
ICPR
2008
IEEE
14 years 3 months ago
Regression with interval output values
We consider a regression problem where target values are given as intervals, and propose a statistical approach to it. Although it is hard to solve the optimization problem direct...
Hisashi Kashima, Kazutaka Yamasaki, Akihiro Inokuc...
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 26 days ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
CVPR
2008
IEEE
14 years 11 months ago
Combining appearance models and Markov Random Fields for category level object segmentation
Object models based on bag-of-words representations can achieve state-of-the-art performance for image classification and object localization tasks. However, as they consider obje...
Diane Larlus, Frédéric Jurie