Sciweavers

74 search results - page 4 / 15
» Infinite Time Register Machines
Sort
View
ALT
2010
Springer
13 years 2 months ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
ICML
2008
IEEE
14 years 8 months ago
Beam sampling for the infinite hidden Markov model
The infinite hidden Markov model is a nonparametric extension of the widely used hidden Markov model. Our paper introduces a new inference algorithm for the infinite Hidden Markov...
Jurgen Van Gael, Yunus Saatci, Yee Whye Teh, Zoubi...
CP
2000
Springer
13 years 11 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
WCRE
2002
IEEE
14 years 15 days ago
Register Liveness Analysis for Optimizing Dynamic Binary Translation
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
Mark Probst, Andreas Krall, Bernhard Scholz
ISCA
2003
IEEE
124views Hardware» more  ISCA 2003»
14 years 27 days ago
Banked Multiported Register Files for High-Frequency Superscalar Microprocessors
Multiported register files are a critical component of high-performance superscalar microprocessors. Conventional multiported structures can consume significant power and die ar...
Jessica H. Tseng, Krste Asanovic