1403 search results - page 236 / 281 » Set cover algorithms for very large datasets |
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
DEXAW
2005
IEEE
14 years 2 months ago
2005
IEEE
Resource discovery in a Grid environment is a critical problem, as a typical Grid system includes a very large number of resources, which must be readily identified and accessed ...
ICCV
1999
IEEE
14 years 10 months ago
1999
IEEE
We show how to use a sampling method to find sparsely clad people in static images. People are modeled as an assembly of nine cylindrical segments. Segments are found using an EM ...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— Complex, autonomous robots integrate a large set of sometimes very diverse algorithms across at least three levels of system organization: the agent architecture, the implement...
KES
2005
Springer
14 years 2 months ago
2005
Springer
In KDD procedure, to fill in missing data typically requires a very large investment of time and energy - often 80% to 90% of a data analysis project is spent in making the data re...