2638 search results - page 107 / 528 » Random Geometric Complexes |
122
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
120
click to vote
ICDAR
2003
IEEE
15 years 9 months ago
2003
IEEE
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
180
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
159
click to vote
STACS
2001
Springer
15 years 9 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
140
click to vote
SIGGRAPH
1992
ACM
15 years 8 months ago
1992
ACM
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...