Sciweavers

3405 search results - page 35 / 681
» Factoring Groups Efficiently
Sort
View
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
14 years 1 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
CRYPTO
1991
Springer
150views Cryptology» more  CRYPTO 1991»
14 years 11 hour ago
CM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
Neal Koblitz
PCM
2010
Springer
179views Multimedia» more  PCM 2010»
13 years 6 months ago
3D Similarity Search Using a Weighted Structural Histogram Representation
A fast and robust 3D retrieval method is proposed based on a novel weighted structural histogram representation. Our method has the following steps: 1) adaptively segment any 3D sh...
Tong Lu, Rongjun Gao, Tuantuan Wang, Yubin Yang
HICSS
2007
IEEE
112views Biometrics» more  HICSS 2007»
13 years 10 months ago
A Framework for Studying Voting in Group Support Systems
Group decision making is essential in organizations. Group Support Systems (GSS) can aide groups in making decisions by providing tools and process support. Voting tools have been...
Kung-E Cheng, Fadi P. Deek
HICSS
2006
IEEE
165views Biometrics» more  HICSS 2006»
14 years 2 months ago
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast
Secure multicast has a variety of applications in ecommerce, e-banking, command and control, video-ondemand, and other internet-based services. In this paper, we present algorithm...
Mohammad Hossain Heydari, Linda Morales, Ivan Hal ...