Sciweavers

4328 search results - page 715 / 866
» A New Kind of Science
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
16 years 1 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
ICCS
2009
Springer
16 years 29 days ago
An Intelligent Tutoring System for Interactive Learning of Data Structures
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...
Rafael del Vado Vírseda, Pablo Ferná...
HICSS
2008
IEEE
168views Biometrics» more  HICSS 2008»
16 years 26 days ago
Current Practices in Field Force Automation: Decision Support and Information Management for the Field Force
In the past, field operations have mostly been a stepchild of information and communication technology (ICT) enabled organizational overhaul and process re-design. Recently, incre...
Gwen Trentham, Hans Jochen Scholl
HICSS
2008
IEEE
185views Biometrics» more  HICSS 2008»
16 years 26 days ago
Organizational Readiness for Business Process Outsourcing: A Model of Determinants and Impact on Outsourcing Success
In innovation adoption literature, the important role of the organizational context as a determinant of information systems (IS) success has long been pointed out. Various factors...
Sebastian F. Martin, Daniel Beimborn, Mihir A. Par...