Sciweavers

9176 search results - page 1681 / 1836
» algorithms 2010
Sort
View
CIKM
2010
Springer
15 years 5 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
CIKM
2010
Springer
15 years 5 months ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu
CIKM
2010
Springer
15 years 5 months ago
On the selectivity of multidimensional routing indices
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
CIKM
2010
Springer
15 years 5 months ago
Mining interesting link formation rules in social networks
Link structures are important patterns one looks out for when modeling and analyzing social networks. In this paper, we propose the task of mining interesting Link Formation rules...
Cane Wing-ki Leung, Ee-Peng Lim, David Lo, Jianshu...
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 5 months ago
Secret Key Generation for a Pairwise Independent Network Model
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Pr...
« Prev « First page 1681 / 1836 Last » Next »