Sciweavers

302 search results - page 9 / 61
» Problem space promotion and its evaluation as a technique fo...
Sort
View
CCGRID
2006
IEEE
14 years 10 days ago
Density-Based Clustering for Similarity Search in a P2P Network
P2P systems represent a large portion of the Internet traffic which makes the data discovery of great importance to the user and the broad Internet community. Hence, the power of ...
Mouna Kacimi, Kokou Yétongnon
ICDE
2009
IEEE
115views Database» more  ICDE 2009»
14 years 10 months ago
Efficient Evaluation of Multiple Preference Queries
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
PODC
2010
ACM
13 years 10 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
CCGRID
2008
IEEE
14 years 3 months ago
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks
In this work we examine a task scheduling and data migration problem for Grid Networks, which we refer to as the Data Consolidation (DC) problem. DC arises when a task needs for i...
Panagiotis C. Kokkinos, Kostas Christodoulopoulos,...
IJNSEC
2008
106views more  IJNSEC 2008»
13 years 8 months ago
Parallel Hardware Architectures for the Cryptographic Tate Pairing
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
Guido Marco Bertoni, Luca Breveglieri, Pasqualina ...