400 search results - page 38 / 80 » What Makes a Problem GP-Hard |
160
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: The ambition of most molecular biologists is the understanding of the intricate network of molecular interactions that control biological systems. As scientists uncove...
137
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
130
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
138
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
134
click to vote
ICCAD
2002
IEEE
16 years 1 months ago
2002
IEEE
We investigate appropriate regimes for transmission line propagation of signals on digital integrated circuits. We start from exact solutions to the transmission line equations pr...