Sciweavers

1132 search results - page 74 / 227
» Structural Average Case Complexity
Sort
View
ICDE
2002
IEEE
209views Database» more  ICDE 2002»
14 years 10 months ago
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura
CGA
2004
13 years 8 months ago
Flexible Point-Based Rendering on Mobile Devices
Point-based rendering is a compact and efficient means of displaying complex geometry. Our goal is to enable flexible point-based rendering, permitting local image refinement, req...
Florent Duguet, George Drettakis
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
14 years 1 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 9 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt