Sciweavers

308 search results - page 43 / 62
» How Fast Is the k-Means Method
Sort
View
181
Voted
SDM
2012
SIAM
247views Data Mining» more  SDM 2012»
13 years 5 months ago
Simplex Distributions for Embedding Data Matrices over Time
Early stress recognition is of great relevance in precision plant protection. Pre-symptomatic water stress detection is of particular interest, ultimately helping to meet the chal...
Kristian Kersting, Mirwaes Wahabzada, Christoph R&...
OHS
2001
Springer
15 years 8 months ago
METIOREW: An Objective Oriented Content Based and Collaborative Recommending System
The size of Internet has been growing very fast and many documents appear every day in the Net. Users find many problems to obtain the information that they really need. In order t...
David Bueno, Ricardo Conejo, Amos David
CVPR
1998
IEEE
16 years 5 months ago
Incorporating Illumination Constraints in Deformable Models
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
Dimitris Samaras, Dimitris N. Metaxas
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 3 months ago
Relational data pre-processing techniques for improved securities fraud detection
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
Andrew Fast, Lisa Friedland, Marc Maier, Brian Tay...
136
Voted
BMCBI
2007
148views more  BMCBI 2007»
15 years 3 months ago
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Background: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homo...
Giulio Pavesi, Federico Zambelli, Graziano Pesole