Sciweavers

1392 search results - page 234 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
88
Voted
AAAI
2012
13 years 2 days ago
Identifying Bullies with a Computer Game
Current computer involvement in adolescent social networks (youth between the ages of 11 and 17) provides new opportunities to study group dynamics, interactions amongst peers, an...
Juan Fernando Mancilla-Caceres, Wen Pu, Eyal Amir,...
COMPGEOM
2005
ACM
14 years 11 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
80
Voted
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 1 months ago
An Improved Construction for Counting Bloom Filters
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
15 years 7 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
PKDD
2005
Springer
123views Data Mining» more  PKDD 2005»
15 years 3 months ago
A Multi-metric Index for Euclidean and Periodic Matching
In many classification and data-mining applications the user does not know a priori which distance measure is the most appropriate for the task at hand without examining the produ...
Michail Vlachos, Zografoula Vagena, Vittorio Caste...