Sciweavers

1397 search results - page 276 / 280
» Algorithms for Proximity Problems on Colored Point Sets
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SIGCOMM
2009
ACM
14 years 1 months ago
DIRC: increasing indoor wireless capacity using directional antennas
The demand for wireless bandwidth in indoor environments such as homes and offices continues to increase rapidly. Although wireless technologies such as MIMO can reach link throug...
Xi Liu, Anmol Sheth, Michael Kaminsky, Konstantina...
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 1 months ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy
MM
2005
ACM
171views Multimedia» more  MM 2005»
14 years 28 days ago
Semantic manifold learning for image retrieval
Learning the user’s semantics for CBIR involves two different sources of information: the similarity relations entailed by the content-based features, and the relevance relatio...
Yen-Yu Lin, Tyng-Luh Liu, Hwann-Tzong Chen
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 5 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...