Sciweavers

29082 search results - page 407 / 5817
» The Time-Triggered Model of Computation
Sort
View
APWEB
2010
Springer
15 years 7 months ago
A Space and Time Efficient Algorithm for SimRank Computation
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
Weiren Yu, Xuemin Lin, Jiajin Le
AML
2008
66views more  AML 2008»
15 years 7 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
ACL
2010
15 years 4 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
ICCV
2001
IEEE
16 years 8 months ago
On Projection Matrices and their Applications in Computer Vision
Projection matrices from projective spaces ? to ? have long been used in multiple-view geometry to model the perspective projection created by the pin-hole camera. In this work we...
Lior Wolf, Amnon Shashua