279 search results - page 16 / 56 » Approximating Average Parameters of Graphs |
TPDS
2008
13 years 7 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
CAPTECH
1998
Springer
13 years 11 months ago
1998
Springer
A method for matching sequences from two perspective views of a moving person silhouette is presented. Regular (approximate uniform thickness) parts are detected on an image and a ...
RSFDGRC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a study on a rough set based approach for feature selection. Instead of using significance or support, Parameterized Average Support Heuristic (PASH) consider...
SIGECOM
2004
ACM
14 years 1 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
WAOA
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...