Sciweavers

1136 search results - page 7 / 228
» Finding Small Holes
Sort
View
CVHI
2007
13 years 11 months ago
Terrain Analysis for Blind Wheelchair Users: Computer Vision Algorithms for Finding Curbs and other Negative Obstacles
: We are developing computer vision algorithms for sensing important terrain features as an aid to wheelchair navigation, which interpret visual information obtained from images co...
James Coughlan, Huiying Shen
CORR
2008
Springer
79views Education» more  CORR 2008»
13 years 10 months ago
Non-classical Role of Potential Energy in Adiabatic Quantum Annealing
Adiabatic quantum annealing is a paradigm of analog quantum computation, where a given computational job is converted to the task of finding the global minimum of some classical po...
Arnab Das
JCT
2006
92views more  JCT 2006»
13 years 9 months ago
Classification of small (0, 2)-graphs
We find the graphs of valency at most 7 with the property that any two nonadjacent vertices have either 0 or 2 common neighbours. In particular, we find all semibiplanes of block ...
Andries E. Brouwer
AAAI
2007
14 years 4 days ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
MOBIHOC
2009
ACM
14 years 10 months ago
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
Dezun Dong, Yunhao Liu, Xiangke Liao