Sciweavers

24368 search results - page 4535 / 4874
» Distributed Computing Economics
Sort
View
CIKM
2010
Springer
15 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
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...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
CIKM
2010
Springer
15 years 5 months ago
Preference query evaluation over expensive attributes
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...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
ICRA
2010
IEEE
158views Robotics» more  ICRA 2010»
15 years 5 months ago
Real-time monocular SLAM: Why filter?
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...
Hauke Strasdat, J. M. M. Montiel, Andrew J. Daviso...
TC
2010
15 years 5 months ago
Network-on-Chip Hardware Accelerators for Biological Sequence Alignment
—The most pervasive compute operation carried out in almost all bioinformatics applications is pairwise sequence homology detection (or sequence alignment). Due to exponentially ...
Souradip Sarkar, Gaurav Ramesh Kulkarni, Partha Pr...
TIFS
2010
186views more  TIFS 2010»
15 years 5 months ago
An abuse-free fair contract-signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang
« Prev « First page 4535 / 4874 Last » Next »