Sciweavers

3894 search results - page 430 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
CCCG
2007
15 years 6 months ago
Triangulations Loosing Bundles and Weight
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
Cem Boyaci, Hale Erten, Alper Üngör
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 8 months ago
Orphan-Free Anisotropic Voronoi Diagrams
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
Guillermo D. Cañas, Steven J. Gortler
CVPR
2012
IEEE
13 years 7 months ago
Image denoising: Can plain neural networks compete with BM3D?
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
Harold Christopher Burger, Christian J. Schuler, S...
ATAL
2009
Springer
15 years 11 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
IPPS
2005
IEEE
15 years 10 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer