Sciweavers

5595 search results - page 682 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
JCO
2006
103views more  JCO 2006»
15 years 7 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
TIP
2008
128views more  TIP 2008»
15 years 7 months ago
Wavelet Frame Accelerated Reduced Support Vector Machines
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
Matthias Rätsch, Gerd Teschke, Sami Romdhani,...
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 11 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
MCS
2001
Springer
16 years 4 days ago
Automatic Model Selection in a Hybrid Perceptron/Radial Network
We provide several enhancements to our previously introduced algorithm for a sequential construction of a hybrid network of radial and perceptron hidden units [6]. At each stage, ...
Shimon Cohen, Nathan Intrator
ATAL
2010
Springer
15 years 8 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer