Search results for "distinct elements"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Daniel M. Kane, Jelani Nelson, David P. Woodruff	An optimal algorithm for the distinct elements problem.	PODS	2010	DBLP DOI BibTeX RDF	distinct elements, data mining, streaming, query optimization
3	David P. Woodruff	The average-case complexity of counting distinct elements.	ICDT	2009	DBLP DOI BibTeX RDF	distinct elements, data streams
2	Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith	Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.	FOCS	2007	DBLP DOI BibTeX RDF
2	Piotr Indyk, David P. Woodruff	Tight Lower Bounds for the Distinct Elements Problem.	FOCS	2003	DBLP DOI BibTeX RDF
2	Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan	Counting Distinct Elements in a Data Stream.	RANDOM	2002	DBLP DOI BibTeX RDF
1	Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith	Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.	SIAM J. Comput.	2009	DBLP DOI BibTeX RDF
1	Tammar Shrot, Yonatan Aumann, Sarit Kraus	Easy and hard coalition resource game formation problems: a parameterized complexity analysis.	AAMAS	2009	DBLP DOI BibTeX RDF	coalition problems, parameterized complexity
1	Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette	On Finding Small 2-Generating Sets.	COCOON	2009	DBLP DOI BibTeX RDF
1	Yu Zhang, Hong Shen, Hui Tian, Xianchao Zhang	Dynamically Maintaining Duplicate-Insensitive and Time-Decayed Sum Using Time-Decaying Bloom Filter.	ICA3PP	2009	DBLP DOI BibTeX RDF	time-decay, stream, bloom filter
1	Sarah Spence Adams, Matthew Crawford, Caitlin Greeley, Bryce Lee, Mathav Kishore Murugan	Multilevel and multidimensional Hadamard matrices.	Des. Codes Cryptography	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 05B20, 94A99
1	David Ellerman	Counting distinctions: on the conceptual foundations of Shannon's information theory.	Synthese	2009	DBLP DOI BibTeX RDF	Logic of partitions, Logical entropy, Information theory, Shannon entropy
1	Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi	Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic.	EDBT	2008	DBLP DOI BibTeX RDF
1	Amit Chakrabarti, Graham Cormode, Andrew McGregor	Robust lower bounds for communication and stream computation.	STOC	2008	DBLP DOI BibTeX RDF	lower bounds, data streams, communication complexity
1	Terasan Niyomsataya, Ali Miri, Monica Nevins	Unitary Space-Time Group Codes: Diversity Sums From Character Tables.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
1	Peter Beelen, Tom Høholdt	A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm.	ICMCTA	2008	DBLP DOI BibTeX RDF
1	A. Pavan, Srikanta Tirthapura	Range-Efficient Counting of Distinct Elements in a Massive Data Stream.	SIAM J. Comput.	2007	DBLP DOI BibTeX RDF
1	Paul Beame, T. S. Jayram, Atri Rudra	Lower bounds for randomized read/write stream algorithms.	STOC	2007	DBLP DOI BibTeX RDF	communication complexity, data stream algorithms
1	Shuyun Wang, Xiulan Hao, Hexiang Xu, Yunfa Hu	Finding Frequent Items in Data Streams Using ESBF.	PAKDD Workshops	2007	DBLP DOI BibTeX RDF	Algorithm, Stream, Bloom Filter, Frequent Items
1	Cristian Estan, George Varghese, Michael E. Fisk	Bitmap algorithms for counting active flows on high-speed links.	IEEE/ACM Trans. Netw.	2006	DBLP DOI BibTeX RDF	counting distinct elements, traffic measurements
1	Sudipto Guha, Andrew McGregor, Suresh Venkatasubramanian	Streaming and sublinear approximation of entropy and information distances.	SODA	2006	DBLP DOI BibTeX RDF
1	Venkatesan Guruswami, Atri Rudra	Limits to List Decoding Reed-Solomon Codes.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	Peter Danziger, Peter Dukes, Terry S. Griggs, Eric Mendelsohn	On the Intersection Problem for Steiner Triple Systems of Different Orders.	Graphs and Combinatorics	2006	DBLP DOI BibTeX RDF	Steiner triple systems, Intersection number, Quasi-embedding, Intersection, Combinatorial design
1	Venkatesan Guruswami, Atri Rudra	Limits to list decoding Reed-Solomon codes.	STOC	2005	DBLP DOI BibTeX RDF	Johnson bound, list recovering, Reed-Solomon codes, list decoding, BCH codes
1	Farzad Parvaresh, Alexander Vardy	Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time.	FOCS	2005	DBLP DOI BibTeX RDF
1	Xin Li, Fang Bian, Hui Zhang 0002, Christophe Diot, Ramesh Govindan, Wei Hong, Gianluca Iannaccone	Advanced Indexing Techniques for Wide-Area Network Monitoring.	ICDE Workshops	2005	DBLP DOI BibTeX RDF
1	Pavan Aduri, Srikanta Tirthapura	Range Efficient Computation of F0 over Massive Data Streams.	ICDE	2005	DBLP DOI BibTeX RDF
1	Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel	Implementing the Arithmetic of C3, 4Curves.	ANTS	2004	DBLP DOI BibTeX RDF
1	Philippe Flajolet	Counting by Coin Tossings.	ASIAN	2004	DBLP DOI BibTeX RDF
1	Tetsuya Abe	Sumsets Containing Powers of an Integer.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 11B13, 05D05
1	Graham Cormode, S. Muthukrishnan	Estimating Dominance Norms of Multiple Data Streams.	ESA	2003	DBLP DOI BibTeX RDF
1	Marianne Durand, Philippe Flajolet	Loglog Counting of Large Cardinalities (Extended Abstract).	ESA	2003	DBLP DOI BibTeX RDF
1	Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar	Merging and Sorting By Strip Moves.	FSTTCS	2003	DBLP DOI BibTeX RDF
1	Jianwei Niu, Joanne M. Atlee, Nancy A. Day	Composable semantics for model-based notations.	SIGSOFT FSE	2002	DBLP DOI BibTeX RDF	model-based notations, communication, concurrency, composition, operational semantics, formal analysis
1	Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar	Reductions in streaming algorithms, with an application to counting triangles in graphs.	SODA	2002	DBLP DOI BibTeX RDF
1	Keisuke Ishibashi, Masaki Aida, Makoto Imase	Characteristics of Temporal and Spatial Locality of Internet Access Patterns.	NETWORKING Workshops	2002	DBLP DOI BibTeX RDF
1	Mustafa Atici, Andrew Vince	Geodesics in Graphs, an Extremal Set Problem, and Perfect Hash Families.	Graphs and Combinatorics	2002	DBLP DOI BibTeX RDF
1	Bernard Boigelot, Louis Latour	Counting the Solutions of Presburger Equations without Enumerating Them.	CIAA	2001	DBLP DOI BibTeX RDF
1	Patricio V. Poblete	Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors.	Algorithmica	2001	DBLP DOI BibTeX RDF
1	Pou-Lin Wu	On Large Circuits in Matroids.	Graphs and Combinatorics	2001	DBLP DOI BibTeX RDF
1	Ivan Korec	Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States.	MFCS	1997	DBLP DOI BibTeX RDF
1	Martin Dietzfelbinger	Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes.	STACS	1996	DBLP DOI BibTeX RDF
1	Ramiro Liscano, Reda E. Fayek, Allan Manz, Elizabeth R. Stuck, Jean-Yves Tigli	Using a Blackboard to Integrate Multiple Activities and Achieve Strategic Reasoning for Mobile-Robot Navigation. (PDF / PS)	IEEE Expert	1995	DBLP DOI BibTeX RDF
1	Jyrki Katajainen, Tomi Pasanen	Sorting Multisets Stably in Minimum Space.	SWAT	1992	DBLP DOI BibTeX RDF
1	Mahdi Abdelguerfi, Arun K. Sood	Computational Complexity of Sorting and Joining Relations with Duplicates.	IEEE Trans. Knowl. Data Eng.	1991	DBLP DOI BibTeX RDF	duplicate values, attribute columns, distinct tuple values, multirelation, distinct elements, worst time complexity, binary comparisons, three-branch comparisons, natural join operation, computational complexity, computational complexity, relational databases, lower bounds, sorting, sorting, database theory, upper bounds, relations, joining, cardinality
1	Kohei Noshita	Predicting the Number of Distinct Elements in a Multiset.	SIAM J. Comput.	1982	DBLP DOI BibTeX RDF
1	Abraham Waksman	A comparison between two paradigms of intelligent systems: an example.	AFIPS National Computer Conference	1977	DBLP DOI BibTeX RDF