Sciweavers

943 search results - page 30 / 189
» How should data structures and algorithms be taught
Sort
View
WADS
2009
Springer
236views Algorithms» more  WADS 2009»
15 years 4 months ago
Inspecting a Set of Strips Optimally
We consider a set of axis-parallel nonintersecting strips in the plane. An observer starts to the left of all strips and ends to the right, thus visiting all strips in the given or...
Tom Kamphans, Elmar Langetepe
KAIS
2008
150views more  KAIS 2008»
14 years 9 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
15 years 3 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
14 years 8 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
ICDE
2007
IEEE
90views Database» more  ICDE 2007»
15 years 4 months ago
Music Recommendation Mapping and Interface Based on Structural Network Entropy
Recommendation systems generally produce the results of their output to their users in the form of an ordinal list. In the interest of simplicity, these lists are often obscure, ,...
Justin Donaldson