Sciweavers

831 search results - page 2 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
PAMI
2008
152views more  PAMI 2008»
13 years 5 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
MIS
1999
Springer
84views Multimedia» more  MIS 1999»
13 years 9 months ago
Minimizing Bandwidth Requirements for On-Demand Data Delivery
Recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request yet achieve considerable client stream sharing (i.e.,...
Derek L. Eager, Mary K. Vernon, John Zahorjan
IPPS
2007
IEEE
13 years 11 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
IEEEVAST
2010
13 years 2 days ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
IMCSIT
2010
13 years 3 months ago
Finding Patterns in Strings using Suffixarrays
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
Herman Stehouwer, Menno van Zaanen