Sciweavers

518 search results - page 65 / 104
» Beating a Random Assignment
Sort
View
ICPR
2008
IEEE
15 years 9 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
143
Voted
ICC
2007
IEEE
153views Communications» more  ICC 2007»
15 years 8 months ago
Mapping for Iterative MMSE-SIC with Belief Propagation
Abstract— In Multiple-Input Multiple-Output (MIMO) wireless systems, since different signals are transmitted by different antennas simultaneously, interference occurs between the...
Satoshi Gounai, Tomoaki Ohtsuki
ADHOCNOW
2004
Springer
15 years 8 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
SENSYS
2003
ACM
15 years 7 months ago
Anchor-free distributed localization in sensor networks
Many sensor network applications require that each node’s sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configu...
Nissanka B. Priyantha, Hari Balakrishnan, Erik D. ...
ACCV
2010
Springer
14 years 9 months ago
A Unified Approach to Segmentation and Categorization of Dynamic Textures
Dynamic textures (DT) are videos of non-rigid dynamical objects, such as fire and waves, which constantly change their shape and appearance over time. Most of the prior work on DT ...
Avinash Ravichandran, Paolo Favaro, René Vi...