Sciweavers

310 search results - page 57 / 62
» Randomized Binary Search Trees
Sort
View
ICASSP
2011
IEEE
13 years 1 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. ...
CORR
2004
Springer
144views Education» more  CORR 2004»
13 years 9 months ago
The Google Similarity Distance
Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is...
Rudi Cilibrasi, Paul M. B. Vitányi
ICML
2007
IEEE
14 years 10 months ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver
HSNMC
2004
Springer
125views Multimedia» more  HSNMC 2004»
14 years 3 months ago
A Pull-Based Approach for a VoD Service in P2P Networks
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
Anwar Al Hamra, Ernst W. Biersack, Guillaume Urvoy...
TIP
2002
105views more  TIP 2002»
13 years 9 months ago
Tree-structured method for LUT inverse halftoning and for image halftoning
1 Recently the authors proposed a Look Up Table (LUT) based method for inverse halftoning of images. The LUT for inverse halftoning is obtained from the histogram gathered from a f...
Murat Mese, Palghat P. Vaidyanathan