Sciweavers

1241 search results - page 204 / 249
» Prolog Server Pages
Sort
View
OOPSLA
1995
Springer
15 years 8 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
SC
1995
ACM
15 years 8 months ago
Analysis of Multilevel Graph Partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
George Karypis, Vipin Kumar
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 8 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
GECCO
2010
Springer
248views Optimization» more  GECCO 2010»
15 years 8 months ago
Integrating decision space diversity into hypervolume-based multiobjective search
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
Tamara Ulrich, Johannes Bader, Eckart Zitzler
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 8 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld