Sciweavers

2137 search results - page 208 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
PREMI
2005
Springer
15 years 12 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 6 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
TON
2010
197views more  TON 2010»
15 years 4 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
SCALESPACE
2007
Springer
16 years 17 days ago
Discrete Regularization on Weighted Graphs for Image and Mesh Filtering
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...
Sébastien Bougleux, Abderrahim Elmoataz, Ma...