6315 search results - page 1191 / 1263 » Approximating Solution Structure |
122
Voted
SAS
2010
Springer
15 years 23 days ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
145
click to vote
SDM
2010
SIAM
15 years 22 days 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...
141
click to vote
TKDE
2010
15 years 22 days 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...
122
Voted
TKDE
2010
15 years 22 days 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...
139
click to vote
EGH
2010
Springer
15 years 11 days 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...