Sciweavers

397 search results - page 55 / 80
» Pseudorandom Functions and Lattices
Sort
View
SAC
2009
ACM
15 years 6 months ago
Towards "WYDIWYS" for MIMI using concept analysis
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...
Jie Dai, Remo Mueller, Jacek Szymanski, Guo-Qiang ...
CCA
2009
Springer
15 years 7 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
CVPR
2012
IEEE
13 years 3 months ago
Locality-constrained and spatially regularized coding for scene categorization
Improving coding and spatial pooling for bag-of-words based feature design have gained a lot of attention in recent works addressing object recognition and scene classification. ...
Aymen Shabou, Hervé Le Borgne
ICALP
2011
Springer
14 years 4 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
AOSD
2009
ACM
14 years 11 months ago
Concept analysis for product line requirements
Traditional methods characterize a software product line's requirements using either functional or quality criteria. This appears to be inadequate to assess modularity, detec...
Nan Niu, Steve M. Easterbrook