122 search results - page 21 / 25 » On the Difficulty of Designing Good Classifiers |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
BMCBI
2011
13 years 2 months ago
2011
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
ECCV
2008
Springer
15 years 25 days ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
ECCV
2006
Springer
15 years 25 days ago
2006
Springer
The paper introduces a new framework for feature learning in classification motivated by information theory. We first systematically study the information structure and present a n...
MOBIHOC
2008
ACM
14 years 10 months ago
2008
ACM
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...