Sciweavers

510 search results - page 52 / 102
» Adaptive Distances on Sets of Vectors
Sort
View
FOCS
2004
IEEE
15 years 1 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Whole Genome Phylogeny Based on Clustered Signature String Composition
Peptide compositions constructed out of whole sets of protein sequences can be used as species signatures for phylogenetic analysis. To account for point mutations, an amino acid ...
Xiaomeng Wu, Guohui Lin, Xiu-Feng Wan, Dong Xu
IPPS
2003
IEEE
15 years 3 months ago
Channel Assignment on Strongly-Simplicial Graphs
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
89
Voted
ICIAP
1999
ACM
15 years 2 months ago
Self-Training Statistic Snake for Image Segmentation and Tracking
In this work we propose a new supervised deformable model that generalizes the classical contour-based snake. This model is defined to deform in a feature space generated by a se...
Xose Manuel Pardo, Petia Radeva, Juan José ...
IDEAL
2000
Springer
15 years 1 months ago
Observational Learning with Modular Networks
Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for ...
Hyunjung Shin, Hyoungjoo Lee, Sungzoon Cho