1330 search results - page 53 / 266 » Dynamic Data Structures for Fat Objects and Their Applicatio... |
SC
2005
ACM
14 years 2 months ago
2005
ACM
In contrast to traditional terascale simulations that have known, fixed data inputs, dynamic data-driven (DDD) applications are characterized by unknown data and informed by dynam...
ACMMSP
2005
ACM
14 years 2 months ago
2005
ACM
In general-purpose applications, most data is dynamically allocated. The memory manager therefore plays a crucial role in application performance by determining the spatial locali...
HICSS
2008
IEEE
14 years 3 months ago
2008
IEEE
Wireless sensor applications (WSNs) are often required to simultaneously satisfy conflicting operational objectives (e.g., latency and power consumption). Based on an observation...
PAKDD
2004
ACM
14 years 2 months ago
2004
ACM
Abstract. Traditional clustering algorithms are based on one representation space, usually a vector space. However, in a variety of modern applications, multiple representations ex...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...