Sciweavers

1576 search results - page 23 / 316
» Streaming Algorithms for Independent Sets
Sort
View
RANDOM
1998
Springer
15 years 2 months ago
A Derandomization Using Min-Wise Independent Permutations
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
Andrei Z. Broder, Moses Charikar, Michael Mitzenma...
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
15 years 10 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
ICIP
2002
IEEE
15 years 11 months ago
An ICA algorithm for analyzing multiple data sets
In this paper we derive an independent-component analysis (ICA) method for analyzing two or more data sets simultaneously. Our model permits there to be components individual to t...
Ana S. Lukic, Lars Kai Hansen, Miles N. Wernick, S...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 1 months ago
A new version of the ant-miner algorithm discovering unordered rule sets
The Ant-Miner algorithm, first proposed by Parpinelli and colleagues, applies an ant colony optimization heuristic to the classification task of data mining to discover an ordered...
James Smaldon, Alex Alves Freitas
TC
1998
14 years 9 months ago
Resilient Authentication Using Path Independence
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
Michael K. Reiter, Stuart G. Stubblebine