Sciweavers

1728 search results - page 217 / 346
» The Accelerated Euclidean Algorithm
Sort
View
ICML
2007
IEEE
16 years 4 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
MOBIHOC
2008
ACM
16 years 2 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
MM
2009
ACM
118views Multimedia» more  MM 2009»
15 years 9 months ago
Vocabulary-based hashing for image search
This paper proposes a hash function family based on feature vocabularies and investigates the application in building indexes for image search. Each hash function is associated wi...
Yingyu Liang, Jianmin Li, Bo Zhang
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
15 years 9 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
ICC
2008
IEEE
137views Communications» more  ICC 2008»
15 years 9 months ago
Optimal Precoding for Orthogonalized Spatial Multiplexing in MIMO Wireless Systems
— This paper proposes a new precoding algorithm for orthogonalized spatial multiplexing (OSM) systems over flatfading multiple-input multiple-output (MIMO) channels. The OSM sch...
Young-Tae Kim, Heunchul Lee, Seokhwan Park, Inkyu ...