Sciweavers

6095 search results - page 1216 / 1219
» Learning in Local Search
Sort
View
FGR
2011
IEEE
288views Biometrics» more  FGR 2011»
13 years 1 months ago
Hierarchical CRF with product label spaces for parts-based models
— Non-rigid object detection is a challenging open research problem in computer vision. It is a critical part in many applications such as image search, surveillance, humancomput...
Gemma Roig, Xavier Boix Bosch, Fernando De la Torr...
BMCBI
2011
13 years 1 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
NAR
2011
208views Computer Vision» more  NAR 2011»
13 years 20 days ago
The UCSC Genome Browser database: update 2011
The University of California, Santa Cruz Genome Browser (http://genome.ucsc.edu) offers online access to a database of genomic sequence and annotation data for a wide variety of o...
Pauline A. Fujita, Brooke L. Rhead, Ann S. Zweig, ...
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
13 years 19 days ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
ASIACRYPT
2011
Springer
12 years 9 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
« Prev « First page 1216 / 1219 Last » Next »