Sciweavers

1845 search results - page 256 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
PVLDB
2008
127views more  PVLDB 2008»
13 years 7 months ago
Hashed samples: selectivity estimators for set similarity selection queries
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
Marios Hadjieleftheriou, Xiaohui Yu, Nick Koudas, ...
ICASSP
2011
IEEE
12 years 12 months ago
Maximum likelihood ICA of quaternion Gaussian vectors
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
ASIACRYPT
2011
Springer
12 years 8 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 10 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 10 days ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger