Sciweavers

5153 search results - page 170 / 1031
» Introduction to Randomized Algorithms
Sort
View
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 5 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
ICC
2007
IEEE
101views Communications» more  ICC 2007»
15 years 9 months ago
On the Limitations of Random Sensor Placement for Distributed Signal Detection
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...
Zhenyu Tu, Rick S. Blum
PROVSEC
2007
Springer
15 years 9 months ago
Practical Threshold Signatures Without Random Oracles
We propose a secure threshold signature scheme without trusted dealer. Our construction is based on the recently proposed signature scheme of Waters in EUROCRYPT’05. The new thre...
Jin Li, Tsz Hon Yuen, Kwangjo Kim
CAEPIA
2003
Springer
15 years 8 months ago
Generating Random Orthogonal Polygons
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
Ana Paula Tomás, António Leslie Baju...
NIPS
2007
15 years 4 months ago
Random Features for Large-Scale Kernel Machines
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
Ali Rahimi, Benjamin Recht