Sciweavers

2080 search results - page 127 / 416
» Measuring empirical computational complexity
Sort
View
COMPGEOM
2001
ACM
15 years 10 months ago
Efficient and small representation of line arrangements with applications
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...
David P. Dobkin, Ayellet Tal
BMCBI
2010
110views more  BMCBI 2010»
15 years 6 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
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...
Tamir Tuller, Yifat Felder, Martin Kupiec
WOSP
1998
ACM
15 years 10 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
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...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
CVPR
2012
IEEE
13 years 8 months ago
Unsupervised metric fusion by cross diffusion
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...
Bo Wang, Jiayan Jiang, Wei Wang 0028, Zhi-Hua Zhou...
CSO
2009
IEEE
16 years 1 months ago
A Special Prosodic Phrasing in Broadcasting News Programs
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...
Yu Zou, Wei He, Yuqiang Zhang, Min Hou, Weibin Zhu