2200 search results - page 204 / 440 » Bloch's Constant is Computable |
160
click to vote
STRINGOLOGY
2008
15 years 8 months ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
182
click to vote
SNPD
2007
15 years 8 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
163
click to vote
AAAI
2006
15 years 8 months ago
2006
Teams of robots are more fault tolerant than single robots, and auctions appear to be promising means for coordinating them. In a recent paper at "Robotics: Science and Syste...
156
click to vote
CCCG
2006
15 years 8 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
164
click to vote
ICONIP
2004
15 years 8 months ago
2004
Variational methods have proved popular and effective for inference and learning in intractable graphical models. An attractive feature of the approaches based on the Kullback-Lei...