Sciweavers

2969 search results - page 173 / 594
» A space efficient algorithm for group structure computation
Sort
View
154
Voted
ACNS
2006
Springer
148views Cryptology» more  ACNS 2006»
15 years 7 months ago
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
Dongvu Tonien, Reihaneh Safavi-Naini
98
Voted
COMSIS
2010
15 years 1 months ago
MFI-tree: An effective multi-feature index structure for weighted query application
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
Yunfeng He, Junqing Yu
110
Voted
ICPR
2002
IEEE
15 years 8 months ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho
127
Voted
EDCC
2008
Springer
15 years 5 months ago
Targeted Distribution of Resource Allocation for Backup LSP Computation
Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
147
Voted
IJBC
2008
112views more  IJBC 2008»
15 years 3 months ago
Computation and Visualization of bifurcation Surfaces
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...
Dirk Stiefs, Thilo Gross, Ralf Steuer, Ulrike Feud...