318 search results - page 41 / 64 » Decomposition of Domains |
113
Voted
ATAL
2011
Springer
13 years 10 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
95
Voted
ICCAD
2009
IEEE
14 years 8 months ago
2009
IEEE
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
SIAMMAX
2010
14 years 5 months ago
2010
It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coeff...
75
Voted
ICCV
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper presents a topologically adaptable snakes model for image segmentation and object representation. The model is embedded in the framework of domain subdivision using sim...
121
Voted
COMSWARE
2008
IEEE
15 years 4 months ago
2008
IEEE
Some works are reported in the frequency domain watermarking using Single Value Decomposition (SVD). The two most commonly used methods are based on DCT-SVD and DWTSVD. The commonl...