Sciweavers

2168 search results - page 109 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
16 years 9 days ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
TALG
2010
158views more  TALG 2010»
15 years 1 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
189
Voted
COMPGEOM
1998
ACM
15 years 11 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
MICCAI
2007
Springer
16 years 7 months ago
Object Localization Based on Markov Random Fields and Symmetry Interest Points
We present an approach to detect anatomical structures by configurations of interest points, from a single example image. The representation of the configuration is based on Markov...
Branislav Micusík, Georg Langs, Horst Bisch...
ICC
2007
IEEE
16 years 1 months ago
Opportunistic Power Allocation for Random Beamforming in MISO Broadcast Channels
Abstract— This paper proposes the opportunistic power allocation (OPA) scheme for random beamforming with a limited feedback rate. Without the channel state information, the prop...
Edward W. Jang, Hyukjoon Kwon, John M. Cioffi