Sciweavers

2542 search results - page 216 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
93
Voted
CSSE
2006
IEEE
15 years 21 days ago
Experimental analysis of a privacy-preserving scalar product protocol
The recent investigation of privacy-preserving data mining has been motivated by the growing concern about the privacy of individuals when their data is stored, aggregated, and mi...
Zhiqiang Yang, Rebecca N. Wright, Hiranmayee Subra...
TEC
2002
161views more  TEC 2002»
15 years 10 days ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
123
Voted
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 1 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
ICIP
2006
IEEE
16 years 2 months ago
Signal Processing Problems and Algorithms in Display Side of 3DTV
Two important signal processing problems in the display side of a holographic 3DTV are the computation of the diffraction field of a 3D object from its abstract representation, an...
Atanas P. Gotchev, Erdem Ulusoy, Gokhan Bora Esmer...
94
Voted
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
Human Motion Synthesis with Optimization-based Graphs
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
Cheng Ren, Liming Zhao, Alla Safonova