Sciweavers

1018 search results - page 21 / 204
» Property Testing in Computational Geometry
Sort
View
FOCS
2005
IEEE
14 years 4 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 5 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
IPSN
2011
Springer
13 years 2 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
ECCV
2002
Springer
15 years 23 days ago
Estimation of Multiple Illuminants from a Single Image of Arbitrary Known Geometry
We present a new method for the detection and estimation of multiple illuminants, using one image of any object with known geometry and Lambertian reflectance. Our method obviates ...
Yang Wang, Dimitris Samaras
ICCV
2009
IEEE
15 years 3 months ago
Color Constancy using 3D Scene Geometry
The aim of color constancy is to remove the effect of the color of the light source. As color constancy is inherently an ill-posed problem, most of the existing color constancy ...
Rui Lu, Arjan Gijsenij, Theo Gevers