Sciweavers

3946 search results - page 145 / 790
» The computational complexity of choice sets
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
CEC
2010
IEEE
15 years 7 months ago
Optimization of biogas production with computational intelligence a comparative study
Biogas plants are reliable sources of energy based on renewable materials including organic waste. There is a high demand from industry to run these plants efficiently, which lead...
Jörg Ziegenhirt, Thomas Bartz-Beielstein, Oli...
DEXA
2008
Springer
132views Database» more  DEXA 2008»
15 years 8 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
CHI
2007
ACM
15 years 10 months ago
Follow the reader: filtering comments on slashdot
Large-scale online communities need to manage the tension between critical mass and information overload. Slashdot is a news and discussion site that has used comment rating to al...
Cliff Lampe, Erik W. Johnston, Paul Resnick
BMCBI
2010
110views more  BMCBI 2010»
15 years 6 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec