Sciweavers

7930 search results - page 27 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICIP
2004
IEEE
14 years 9 months ago
Learning structured dictionaries for image representation
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effec...
Gianluca Monaci, Pierre Vandergheynst
MOBIHOC
2009
ACM
14 years 8 months ago
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
Dong-Hoon Shin, Saurabh Bagchi
DM
2010
108views more  DM 2010»
13 years 7 months ago
Grundy number and products of graphs
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
Marie Asté, Frédéric Havet, C...
ISCI
2008
88views more  ISCI 2008»
13 years 7 months ago
Greedy regression ensemble selection: Theory and an application to water quality prediction
This paper studies the greedy ensemble selection family of algorithms for ensembles of regression models. These algorithms search for the globally best subset of regresmaking loca...
Ioannis Partalas, Grigorios Tsoumakas, Evaggelos V...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo