Sciweavers

194 search results - page 34 / 39
» Better polynomials for GNFS
Sort
View
ICPADS
2007
IEEE
16 years 25 days ago
Energy-efficient anonymous multicast in mobile ad-hoc networks
Protecting personal privacy and energy efficiency are two primary concerns for mobile ad hoc networks. However, no energy-efficient multicast algorithm designed for preserving ano...
Jung-Chun Kao, Radu Marculescu
EPIA
2007
Springer
16 years 21 days ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...
ICMCS
2005
IEEE
229views Multimedia» more  ICMCS 2005»
16 years 3 days ago
A methodology for improving recognition rate of linear discriminant analysis in video-based face recognition using support vecto
This paper proposes a two-step methodology for improving the discriminatory power of Linear Discriminant Analysis (LDA) for video-based human face recognition. Results indicate th...
Sreekar Krishna, Sethuraman Panchanathan
ACISP
2005
Springer
16 years 2 days ago
Building Secure Tame-like Multivariate Public-Key Cryptosystems: The New TTS
Abstract. Multivariate public-key cryptosystems (sometimes polynomial-based PKC’s or just multivariates) handle polynomials of many variables over relatively small fields instea...
Bo-Yin Yang, Jiun-Ming Chen
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
16 years 1 days ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...