Sciweavers

406 search results - page 61 / 82
» Database-friendly random projections
Sort
View
GIS
2008
ACM
14 years 8 months ago
Mapping geographic coverage of the web
In this paper, we describe a methodology to estimate the geographic coverage of the web without the need for secondary knowledge or complex geo-tagging. This is achieved by random...
Robert Pasley, Paul Clough, Ross S. Purves, Floria...
ISBI
2008
IEEE
14 years 8 months ago
Knee reconstruction through efficient linear programming
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...
Mihai Sardarescu, Nikos Paragios, Nikos Komodakis,...
WWW
2003
ACM
14 years 8 months ago
Detecting Near-replicas on the Web by Content and Hyperlink Analysis
The presence of replicas or near-replicas of documents is very common on the Web. Documents may be replicated completely or partially for different reasons (versions, mirrors, etc...
Ernesto Di Iorio, Michelangelo Diligenti, Marco Go...
ICSE
2005
IEEE-ACM
14 years 7 months ago
Validation methods for calibrating software effort models
COCONUT calibrates effort estimation models using an exhaustive search over the space of calibration parameters in a COCOMO I model. This technique is much simpler than other effo...
Tim Menzies, Daniel Port, Zhihao Chen, Jairus Hihn...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 4 months ago
Approximate Spectral Clustering.
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-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...