Sciweavers

1845 search results - page 251 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
ICASSP
2011
IEEE
12 years 12 months ago
A robust estimator and detector of circularity of complex signals
Recent research has revealed that circularity (or, propriety) of complex random signals can be exploited in developing optimal signal processors. In this paper, a robust estimator...
Esa Ollila, Visa Koivunen, H. Vincent Poor
ESORICS
2012
Springer
11 years 10 months ago
Unique Group Signatures
We initiate the study of unique group signature such that signatures of the same message by the same user will always have a large common component (i.e., unique identifier). It ...
Matthew K. Franklin, Haibin Zhang
TSP
2010
13 years 2 months ago
Greedy gossip with eavesdropping
Abstract-- This paper presents greedy gossip with eavesdropping (GGE), a new average consensus algorithm for wireless sensor network applications. Consensus algorithms have recentl...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 1 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
COMPGEOM
2008
ACM
13 years 10 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount