Sciweavers

829 search results - page 74 / 166
» A new watermarking approach for relational data
Sort
View
CVPR
2008
IEEE
16 years 3 months ago
Face alignment via boosted ranking model
Face alignment seeks to deform a face model to match it with the features of the image of a face by optimizing an appropriate cost function. We propose a new face model that is al...
Gianfranco Doretto, Hao Wu, Xiaoming Liu 0002
SIGMOD
2009
ACM
141views Database» more  SIGMOD 2009»
16 years 1 months ago
FlexRecs: expressing and combining flexible recommendations
Recommendation systems have become very popular but most recommendation methods are `hard-wired' into the system making experimentation with and implementation of new recomme...
Georgia Koutrika, Benjamin Bercovitz, Hector Garci...
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 1 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
PKDD
2007
Springer
193views Data Mining» more  PKDD 2007»
15 years 7 months ago
Learning Multi-dimensional Functions: Gas Turbine Engine Modeling
Abstract. This paper shows how multi-dimensional functions, describing the operation of complex equipment, can be learned. The functions are points in a shape space, each produced ...
Chris Drummond
BNCOD
2004
184views Database» more  BNCOD 2004»
15 years 2 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank