Sciweavers

3875 search results - page 762 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ALT
2009
Springer
15 years 6 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
IEEEPACT
2009
IEEE
15 years 4 months ago
Using Aggressor Thread Information to Improve Shared Cache Management for CMPs
—Shared cache allocation policies play an important role in determining CMP performance. The simplest policy, LRU, allocates cache implicitly as a consequence of its replacement ...
Wanli Liu, Donald Yeung
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 2 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
SIGGRAPH
1995
ACM
15 years 1 months ago
Realistic modeling for facial animation
A major unsolved problem in computer graphics is the construction and animation of realistic human facial models. Traditionally, facial models have been built painstakingly by man...
Yuencheng Lee, Demetri Terzopoulos, Keith Waters
ML
2006
ACM
14 years 9 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári