Sciweavers

10289 search results - page 1821 / 2058
» Standard bases in K
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
ASPLOS
2009
ACM
16 years 7 months ago
Dynamic prediction of collection yield for managed runtimes
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
Michal Wegiel, Chandra Krintz
MOBIHOC
2009
ACM
16 years 7 months ago
Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels
Providing differentiated Quality of Service (QoS) over unreliable wireless channels is an important challenge for supporting several future applications. We analyze a model that h...
I-Hong Hou, P. R. Kumar
CHI
2004
ACM
16 years 7 months ago
Master usability scaling: magnitude estimation and master scaling applied to usability measurement
Master Usability Scaling (MUS) is a measurement method for developing a universal usability continuum based on magnitude estimation and master scaling. The universal usability con...
Mick McGee
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
16 years 7 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
« Prev « First page 1821 / 2058 Last » Next »