Sciweavers

4110 search results - page 340 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Privacy-Preserving Protocols for Eigenvector Computation
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
Manas A. Pathak, Bhiksha Raj
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 6 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
MONET
2002
95views more  MONET 2002»
15 years 6 months ago
On Improving the Performance of Cache Invalidation in Mobile Environments
Many cache management schemes designed for mobile environments are based on invalidation reports (IRs). However, IR-based approach suffers from long query latency and it cannot eff...
Guohong Cao
TPDS
2002
136views more  TPDS 2002»
15 years 6 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 5 months ago
Towards an incremental maintenance of cyclic association rules
Recently, the cyclic association rules have been introduced in order to discover rules from items characterized by their regular variation over time. In real life situations, temp...
Eya Ben Ahmed, Mohamed Salah Gouider