Sciweavers

4114 search results - page 224 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CVGIP
2008
108views more  CVGIP 2008»
15 years 6 months ago
Efficient texture synthesis using strict Wang Tiles
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very e...
Xinyu Zhang, Young J. Kim
DAC
2006
ACM
16 years 7 months ago
Fast algorithms for slew constrained minimum cost buffering
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...
IJCAI
1997
15 years 8 months ago
Learning to Improve both Efficiency and Quality of Planning
Most research in learning for planning has concentrated on efficiency gains. Another important goal is improving the quality of final plans. Learning to improve plan quality has b...
Tara A. Estlin, Raymond J. Mooney
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 10 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
DAC
2005
ACM
16 years 7 months ago
A new canonical form for fast boolean matching in logic synthesis and verification
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram