5105 search results - page 949 / 1021 » Approximate Structural Consistency |
118
click to vote
SDM
2010
SIAM
14 years 10 months ago
2010
SIAM
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
110
click to vote
TKDE
2010
14 years 10 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
99
Voted
TKDE
2010
14 years 10 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
121
click to vote
EGH
2010
Springer
14 years 10 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
138
click to vote
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...