Sciweavers

1385 search results - page 165 / 277
» Clustering by Random Projections
Sort
View
AHSWN
2008
92views more  AHSWN 2008»
15 years 6 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
ECRA
2010
145views more  ECRA 2010»
15 years 6 months ago
Inferring preference correlations from social networks
Identifying consumer preferences is a key challenge in customizing electronic commerce sites to individual users. The increasing availability of online social networks provides on...
Tad Hogg
EOR
2006
118views more  EOR 2006»
15 years 6 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
CLUSTER
2002
IEEE
15 years 6 months ago
Online Prediction of the Running Time of Tasks
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
Peter A. Dinda
TIP
2002
133views more  TIP 2002»
15 years 6 months ago
A joint inter- and intrascale statistical model for Bayesian wavelet based image denoising
Abstract--This paper presents a new wavelet-based image denoising method, which extends a recently emerged "geometrical" Bayesian framework. The new method combines three...
Aleksandra Pizurica, Wilfried Philips, Ignace Lema...