Sciweavers

5624 search results - page 242 / 1125
» On Conditional Covering Problem
Sort
View
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
15 years 11 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
JC
2007
160views more  JC 2007»
15 years 6 months ago
BDDC methods for discontinuous Galerkin discretization of elliptic problems
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization...
Maksymilian Dryja, Juan Galvis, Marcus Sarkis
AMAI
1999
Springer
15 years 6 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
BROADNETS
2005
IEEE
16 years 7 days ago
Multi-rate throughput optimization for wireless local area network anomaly problem
— Due to varying wireless channel conditions, the IEEE 802.11 wireless local area network (WLAN) standard supports multiple modulation types to accommodate the tradeoff between d...
Yu-Liang Kuo, Kun-Wei Lai, Frank Yeong-Sung Lin, Y...
CVPR
2011
IEEE
14 years 10 months ago
A Novel Parametrization of the Perspective-Three-Point Problem for a Direct Computation of Absolute Camera Position and Orientat
The Perspective-Three-Point (P3P) problem aims at determining the position and orientation of the camera in the world reference frame from three 2D-3D point correspondences. This ...
Laurent Kneip, Davide Scaramuzza, Roland Siegwart