Sciweavers

4103 search results - page 237 / 821
» Some results on the Collatz problem
Sort
View
ICRA
2000
IEEE
86views Robotics» more  ICRA 2000»
15 years 11 months ago
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
Tim Danner, Lydia E. Kavraki
ITS
1998
Springer
115views Multimedia» more  ITS 1998»
15 years 10 months ago
The Authoring Assistant
In some domains, including those requiring natural language understanding, we cannot build a system that can complete the entire task. One way to deal with such cases is to encode ...
Steven Ritter
FOCS
1991
IEEE
15 years 10 months ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 8 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
ESWS
2008
Springer
15 years 8 months ago
Automatic Identity Recognition in The Semantic Web
The OKKAM initiative1 has recently highlighted the need of moving from the traditional web towards a "web of entities", where real-world objects descriptions could be ret...
Alfio Ferrara, Davide Lorusso, Stefano Montanelli