6251 search results - page 196 / 1251 » Randomness, Computability, and Density |
156
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
136
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
117
click to vote
EUC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. For the security technology that has been achieved with software in the computer system and the protection of the intellectual property right of software, software protec...
149
Voted
CVPR
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper develops an analytic model for self shadowing and local illumination of rough surfaces. The surface is assumed homogeneous, isotropic, and smooth microscopically, with ...
132
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract--The paper introduces DILOC, a distributed, iterative algorithm to locate sensors (with unknown locations) in 1, with respect to a minimal number of + 1 anchors with known...