Sciweavers

728 search results - page 130 / 146
» Efficient Searching with Linear Constraints
Sort
View
ITIIS
2010
200views more  ITIIS 2010»
14 years 6 months ago
New Techniques for Anonymous HIBE with Short Ciphertexts in Prime Order Groups
Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key...
Kwangsu Lee, Dong Hoon Lee
CORR
2008
Springer
128views Education» more  CORR 2008»
14 years 12 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
COMCOM
2006
88views more  COMCOM 2006»
14 years 11 months ago
Using attack graphs for correlating, hypothesizing, and predicting intrusion alerts
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
Lingyu Wang, Anyi Liu, Sushil Jajodia
ICCV
2001
IEEE
16 years 1 months ago
Capturing Natural Hand Articulation
Vision-based m,otion captu.ring of hand articulation i s - a ch,allengin,g task, since th,e hand presents a m,otion of high, degrees of freedom.. Model-based approach,es could he ...
Ying Wu, John Y. Lin, Thomas S. Huang
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 5 days ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...