Sciweavers

2131 search results - page 197 / 427
» A computational approximation to the AIXI model
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 7 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
CVPR
2007
IEEE
16 years 8 months ago
Real-time Planar Surface Segmentation in Disparity Space
An iterative Segmentation-Estimation framework for segmentation of planar surfaces in the disparity space is implemented on a Digital Signal Processor (DSP). Disparity of a scene ...
Ninad Thakoor, Sungyong Jung, Jean Gao
ECCV
2004
Springer
16 years 8 months ago
Line Geometry for 3D Shape Understanding and Reconstruction
We understand and reconstruct special surfaces from 3D data with line geometry methods. Based on estimated surface normals we use approximation techniques in line space to recogniz...
Helmut Pottmann, Michael Hofer, Boris Odehnal, Joh...
STACS
2005
Springer
16 years 3 days ago
Centrality Measures Based on Current Flow
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
Ulrik Brandes, Daniel Fleischer