6045 search results - page 1139 / 1209 » Computable Linearizations of Well-partial-orderings |
DAGSTUHL
2007
13 years 9 months ago
2007
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...
DAGSTUHL
2007
13 years 9 months ago
2007
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
DAGSTUHL
2008
13 years 9 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
ICVGIP
2008
13 years 9 months ago
2008
Following the phenomenological approach of gestaltists, sparse monocular depth cues such as T- and X-junctions and the local convexity are crucial to identify the shape and depth ...
ICWS
2008
IEEE
13 years 9 months ago
2008
IEEE
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...