2080 search results - page 35 / 416 » Measuring empirical computational complexity |
ILP
2003
Springer
14 years 3 months ago
2003
Springer
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
ESEM
2007
ACM
14 years 1 months ago
2007
ACM
Providing robust decision support for software engineering (SE) requires the collection of data across multiple contexts so that one can begin to elicit the context variables that...
TIFS
2008
13 years 9 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
ACMACE
2006
ACM
14 years 3 months ago
2006
ACM
A fundamental design question to ask in the development of a network game is—Which transport protocol should be used—TCP, UDP, or some other protocols? Seeking an objective an...
HRI
2006
ACM
14 years 3 months ago
2006
ACM
This paper describes an extensive analysis of the comfort level data of 7 subjects with respect to 12 robot behaviours as part of a human-robot interaction trial. This includes ro...