Sciweavers

2960 search results - page 261 / 592
» Learning from Multiple Sources
Sort
View
161
Voted
KDD
2012
ACM
188views Data Mining» more  KDD 2012»
13 years 7 months ago
A probabilistic model for multimodal hash function learning
In recent years, both hashing-based similarity search and multimodal similarity search have aroused much research interest in the data mining and other communities. While hashing-...
Yi Zhen, Dit-Yan Yeung
GLOBECOM
2007
IEEE
15 years 4 months ago
Cooperative Beamforming for Wireless Ad Hoc Networks
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
Lun Dong, Athina P. Petropulu, H. Vincent Poor
ICOIN
2005
Springer
15 years 10 months ago
S-RO: Simple Route Optimization Scheme with NEMO Transparency
Network mobility (NEMO) basic support protocol maintains the connectivity when mobile router (MR) changes its point of attachment to the Internet by establishing a bidirectional tu...
Hanlim Kim, Geunhyung Kim, Cheeha Kim
149
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
Yunfeng Lin, Ben Liang, Baochun Li
ISNN
2005
Springer
15 years 10 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu