Sciweavers

3946 search results - page 553 / 790
» The computational complexity of choice sets
Sort
View
ACCV
2006
Springer
16 years 20 days ago
Inducing Semantic Segmentation from an Example
Segmenting an image into semantically meaningful parts is a fundamental and challenging task in computer vision. Automatic methods are able to segment an image into coherent region...
Yaar Schnitman, Yaron Caspi, Daniel Cohen-Or, Dani...
COMPGEOM
2006
ACM
16 years 19 days ago
The predicates for the Voronoi diagram of ellipses
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
INTERSENSE
2006
ACM
16 years 19 days ago
Addressing network heterogeneity in pervasive application environments
— Pervasive computing applications typically involve rich interactions and heterogeneous network types; e.g. involving the collation of data from a sensor network into a replicat...
Paul Grace, Geoff Coulson, Gordon S. Blair, Barry ...
IPPS
2005
IEEE
16 years 8 days ago
A Cellular Multi-Objective Genetic Algorithm for Optimal Broadcasting Strategy in Metropolitan MANETs
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
Enrique Alba, Bernabé Dorronsoro, Francisco...
SCALESPACE
2005
Springer
16 years 4 days ago
Texture Mapping via Spherical Multi-dimensional Scaling
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
Asi Elad (Elbaz), Yosi Keller, Ron Kimmel