Sciweavers

401 search results - page 20 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
13 years 11 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
ECCV
2004
Springer
14 years 11 months ago
A Correlation-Based Approach to Robust Point Set Registration
Correlation is a very effective way to align intensity images. We extend the correlation technique to point set registration using a method we call kernel correlation. Kernel corre...
Yanghai Tsin, Takeo Kanade
CVPR
2004
IEEE
14 years 11 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
AI
2000
Springer
14 years 2 months ago
Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasin...
Qiang Yang, Jing Wu