23557 search results - page 4365 / 4712 » Distributed Computing - Introduction |
133
Voted
PVLDB
2008
15 years 3 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
154
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
133
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them e...
138
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— While the most accurate solution to off-line structure from motion (SFM) problems is undoubtedly to extract as much correspondence information as possible and perform g...
148
Voted
TC
2010
15 years 2 months ago
2010
—The most pervasive compute operation carried out in almost all bioinformatics applications is pairwise sequence homology detection (or sequence alignment). Due to exponentially ...