Sciweavers

627 search results - page 29 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
WWW
2007
ACM
15 years 12 months ago
Towards effective browsing of large scale social annotations
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and sh...
Rui Li, Shenghua Bao, Yong Yu, Ben Fei, Zhong Su
CVPR
2012
IEEE
13 years 1 months ago
The use of on-line co-training to reduce the training set size in pattern recognition methods: Application to left ventricle seg
The use of statistical pattern recognition models to segment the left ventricle of the heart in ultrasound images has gained substantial attention over the last few years. The mai...
Gustavo Carneiro, Jacinto C. Nascimento
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 11 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
ANLP
2000
86views more  ANLP 2000»
15 years 19 days ago
A Finite State and Data-Oriented Method for Grapheme to Phoneme Conversion
A finite-state method, based on leftmost longestmatch replacement, is presented for segmenting words into graphemes, and for converting graphemes into phonemes. A small set of han...
Gosse Bouma
BMCBI
2008
133views more  BMCBI 2008»
14 years 11 months ago
CORE_TF: a user-friendly interface to identify evolutionary conserved transcription factor binding sites in sets of co-regulated
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...
Matthew S. Hestand, Michiel van Galen, Michel P. V...