Sciweavers

5153 search results - page 588 / 1031
» Introduction to Randomized Algorithms
Sort
View
ICDAR
2005
IEEE
16 years 4 hour ago
A Model for Detecting and Merging Vertically Spanned Table Cells in Plain Text Documents
A spanned cell in a table is a single, complete unit that physically occupies multiple columns and/or multiple rows. Spanned cells are common in tables, and they are a significan...
Vanessa Long, Robert Dale, Steve Cassidy
120
Voted
ICRA
2005
IEEE
93views Robotics» more  ICRA 2005»
15 years 12 months ago
Robotic Rock Climbing using Computer Vision and Force Feedback
Abstract Climbing robots that climb flat structures using suction cups or magnets are commonly described in the literature. However, robots that can autonomously find randomly plac...
Stephen Paul Linder, Edward Wei, Alexander Clay
LCN
2005
IEEE
15 years 12 months ago
Probabilistic Coverage in Wireless Sensor Networks
— The sensing capabilities of networked sensors are affected by environmental factors in real deployment and it is imperative to have practical considerations at the design stage...
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
15 years 12 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant
163
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 12 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins