Sciweavers

17329 search results - page 3119 / 3466
» Improved non-approximability results
Sort
View
MCS
2010
Springer
15 years 8 months ago
Dynamic Selection of Ensembles of Classifiers Using Contextual Information
In a multiple classifier system, dynamic selection (DS) has been used successfully to choose only the best subset of classifiers to recognize the test samples. Dos Santos et al...
Paulo Rodrigo Cavalin, Robert Sabourin, Ching Y. S...
COMPGEOM
2008
ACM
15 years 8 months ago
Extremal problems on triangle areas in two and three dimensions
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
CONEXT
2008
ACM
15 years 8 months ago
Troubleshooting chronic conditions in large IP networks
Chronic network conditions are caused by performance impairing events that occur intermittently over an extended period of time. Such conditions can cause repeated performance deg...
Ajay Mahimkar, Jennifer Yates, Yin Zhang, Aman Sha...
DAC
2008
ACM
15 years 8 months ago
Application mapping for chip multiprocessors
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
Guangyu Chen, Feihui Li, Seung Woo Son, Mahmut T. ...
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 8 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
« Prev « First page 3119 / 3466 Last » Next »