Sciweavers

10890 search results - page 1933 / 2178
» Automatic Complexity Analysis
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
15 years 3 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
172
Voted
CORR
2010
Springer
221views Education» more  CORR 2010»
15 years 3 months ago
Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition
In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input ...
Debotosh Bhattacharjee, Dipak Kumar Basu, Mita Nas...
INFSOF
2010
146views more  INFSOF 2010»
15 years 3 months ago
Links between the personalities, views and attitudes of software engineers
Successful software development and management depends not only on the technologies, methods and processes employed but also on the judgments and decisions of the humans involved....
Robert Feldt, Lefteris Angelis, Richard Torkar, Ma...
CDC
2010
IEEE
164views Control Systems» more  CDC 2010»
15 years 1 months ago
Stabilization of polytopic delay difference inclusions: Time-varying control Lyapunov functions
This paper studies stabilization of polytopic delay difference inclusions via the Razumikhin approach. An example of a linear delay difference equation that is globally exponential...
Rob H. Gielen, Mircea Lazar
COLING
2010
15 years 1 months ago
Exploring the Data-Driven Prediction of Prepositions in English
Prepositions in English are a well-known challenge for language learners, and the computational analysis of preposition usage has attracted significant attention. Such research ge...
Anas Elghafari, Detmar Meurers, Holger Wunsch
« Prev « First page 1933 / 2178 Last » Next »