Sciweavers

848 search results - page 147 / 170
» Randomness and the linear degrees of computability
Sort
View
ICASSP
2011
IEEE
14 years 3 months ago
Optimum multi-user detection by nonsmooth optimization
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
Hoang Duong Tuan, Tran Thai Son, Hoang Tuy, Ha H. ...
PODC
2006
ACM
15 years 5 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
ECCV
2008
Springer
16 years 1 months ago
Learning Optical Flow
Assumptions of brightness constancy and spatial smoothness underlie most optical flow estimation methods. In contrast to standard heuristic formulations, we learn a statistical mod...
Deqing Sun, Stefan Roth, J. P. Lewis, Michael J. B...
CVPR
2010
IEEE
15 years 5 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
BMCBI
2005
127views more  BMCBI 2005»
14 years 11 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin