6104 search results - page 191 / 1221 » Constructing Information Bases Using Associative Structures |
136
click to vote
ICSM
2006
IEEE
15 years 10 months ago
2006
IEEE
During software evolution a collection of related artifacts with different representations are created. Some of these are composed of structured data (e.g., analysis data), some c...
159
click to vote
EGH
2010
Springer
15 years 2 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...
152
click to vote
WIDM
2005
ACM
15 years 9 months ago
2005
ACM
Clustering the results of a search helps the user to overview the information returned. In this paper, we regard the clustering task as indexing the search results. Here, an index...
158
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
149
click to vote
SPIESR
2003
15 years 5 months ago
2003
We present a framework for analyzing the structure of digital media streams. Though our methods work for video, text, and audio, we concentrate on detecting the structure of digit...