Sciweavers

398 search results - page 40 / 80
» Conformal Mapping by Computationally Efficient Methods
Sort
View
MP
2008
99views more  MP 2008»
14 years 9 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
CVPR
2006
IEEE
15 years 11 months ago
Robust Tracking and Stereo Matching under Variable Illumination
Illumination inconsistencies cause serious problems for classical computer vision applications such as tracking and stereo matching. We present a new approach to model illuminatio...
Jingdan Zhang, Leonard McMillan, Jingyi Yu
ICISC
2004
108views Cryptology» more  ICISC 2004»
14 years 11 months ago
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
VLDB
2006
ACM
171views Database» more  VLDB 2006»
15 years 10 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
NIPS
2004
14 years 11 months ago
Validity Estimates for Loopy Belief Propagation on Binary Real-world Networks
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
Joris M. Mooij, Hilbert J. Kappen