Sciweavers

737 search results - page 56 / 148
» Improving Access to Large Volumes of Online Data
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 2 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
CONEXT
2008
ACM
15 years 3 months ago
Observing slow crustal movement in residential user traffic
It is often argued that rapidly increasing video content along with the penetration of high-speed access is leading to explosive growth in the Internet traffic. Contrary to this p...
Kenjiro Cho, Kensuke Fukuda, Hiroshi Esaki, Akira ...
ICCD
2006
IEEE
97views Hardware» more  ICCD 2006»
15 years 11 months ago
Pesticide: Using SMT Processors to Improve Performance of Pointer Bug Detection
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
Jin-Yi Wang, Yen-Shiang Shue, T. N. Vijaykumar, Sa...
CIKM
2010
Springer
15 years 17 days ago
Brown dwarf: a P2P data-warehousing system
In this demonstration we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data. Deployed on any number of commodity ...
Katerina Doka, Dimitrios Tsoumakos, Nectarios Kozi...
PC
2002
114views Management» more  PC 2002»
15 years 1 months ago
Optimizing noncontiguous accesses in MPI-IO
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by m...
Rajeev Thakur, William Gropp, Ewing L. Lusk