Sciweavers

1289 search results - page 119 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
CORR
2011
Springer
208views Education» more  CORR 2011»
14 years 5 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
USS
2010
14 years 7 months ago
SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics
Secure multiparty computation (MPC) allows joint privacy-preserving computations on data of multiple parties. Although MPC has been studied substantially, building solutions that ...
Martin Burkhart, Mario Strasser, Dilip Many, Xenof...
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
15 years 10 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
INFOCOM
2012
IEEE
13 years 13 days ago
Maximizing system throughput by cooperative sensing in Cognitive Radio Networks
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
Shuang Li, Zizhan Zheng, Eylem Ekici, Ness B. Shro...
ICIP
1997
IEEE
15 years 11 months ago
Bit Allocation Methods for Closed-Loop Coding of Oversampled Pyramid Decompositions
Oversampled pyramid decompositions have been successfully applied to scalable video coding. Quantization noise feedback at the encoder closed-loop coding" has several advant...
Uwe Horn, Thomas Wiegand, Bernd Girod