Sciweavers

824 search results - page 85 / 165
» Constructing Functional Programs for Grammar Analysis Proble...
Sort
View
122
Voted
ICALP
2007
Springer
15 years 8 months ago
Private Locally Decodable Codes
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
Rafail Ostrovsky, Omkant Pandey, Amit Sahai
125
Voted
ICML
2005
IEEE
16 years 3 months ago
Building Sparse Large Margin Classifiers
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
Bernhard Schölkopf, Gökhan H. Bakir, Min...
119
Voted
SAC
2010
ACM
15 years 9 months ago
General constant expressions for system programming languages
Most mainstream system programming languages provide support for builtin types, and extension mechanisms through userdefined types. They also come with a notion of constant expre...
Gabriel Dos Reis, Bjarne Stroustrup
114
Voted
FIW
2009
101views Communications» more  FIW 2009»
15 years 13 days ago
Feature Interaction Detection in the Feature Language Extensions
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
Lei Sun, Lu Zhoa, Yimeng Li, Wu-Hon F. Leung
216
Voted
CP
2009
Springer
16 years 3 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný