140 search results - page 28 / 28 » Random projection algorithms for convex set intersection pro... |
ICCV
2007
IEEE
14 years 7 months ago
2007
IEEE
We consider the problem of estimating detailed 3-d structure from a single still image of an unstructured environment. Our goal is to create 3-d models which are both quantitative...
ISBI
2008
IEEE
14 years 6 months ago
2008
IEEE
In this paper we propose a novel method to recover the 3D shape of the knee and of the prosthesis for the patients that have undergone total knee replacement surgery. We address t...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
ALMOB
2006
13 years 5 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
OOPSLA
2010
Springer
13 years 3 months ago
2010
Springer
Software developers often duplicate source code to replicate functionality. This practice can hinder the maintenance of a software project: bugs may arise when two identical code ...