2080 search results - page 127 / 416 » Measuring empirical computational complexity |
131
click to vote
COMPGEOM
2001
ACM
15 years 8 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
140
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
192
click to vote
WOSP
1998
ACM
15 years 8 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
215
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
Metric learning is a fundamental problem in computer vision. Different features and algorithms may tackle a problem from different angles, and thus often provide complementary inf...
136
click to vote
CSO
2009
IEEE
15 years 11 months ago
2009
IEEE
In order to improve and convey the semantic information perfectly and vividly through synthesized speech, a special prosodic phrasing in broadcasting news programs, namely complex...