Sciweavers

322 search results - page 53 / 65
» An Efficient Solution to the Five-Point Relative Pose Proble...
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 9 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...
AISC
2008
Springer
13 years 11 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
COMPSAC
2004
IEEE
14 years 22 days ago
A Novel Key Management Scheme for Dynamic Access Control in a User Hierarchy
Considering the solution of dynamic access problems in a user hierarchy, a novel scheme based on one-way hash function is proposed to manage the cryptographic keys in the paper. T...
Tzer-Shyong Chen, Yu-Fang Chung, Chang-Sin Tian
FPL
2006
Springer
96views Hardware» more  FPL 2006»
14 years 20 days ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
DPD
2002
168views more  DPD 2002»
13 years 8 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...