Sciweavers

3244 search results - page 325 / 649
» On convex complexity measures
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 7 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
ICSE
2008
IEEE-ACM
16 years 6 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto
ICFP
2007
ACM
16 years 6 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
168
Voted
DCC
2006
IEEE
16 years 6 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley
EUROSYS
2007
ACM
16 years 3 months ago
Fine grained kernel logging with KLogger: experience and insights
Understanding the detailed behavior of an operating system is crucial for making informed design decisions. But such an understanding is very hard to achieve, due to the increasin...
Yoav Etsion, Dan Tsafrir, Scott Kirkpatrick, Dror ...