Sciweavers

3598 search results - page 427 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
CMA
2010
183views more  CMA 2010»
15 years 3 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
NETGAMES
2006
ACM
16 years 18 days ago
On the support for heterogeneity in networked virtual environment
This paper presents our ongoing research activity to design and implement a framework for an networked virtual environment (NVE) that efficiently supports both hardware and softwa...
Hiroshi Fujinoki
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
16 years 1 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
DAC
2005
ACM
16 years 7 months ago
Towards scalable flow and context sensitive pointer analysis
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
Jianwen Zhu
CVPR
2010
IEEE
16 years 3 months ago
Beyond Trees: MRF Inference via Outer-Planar Decomposition
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...