Sciweavers

1326 search results - page 215 / 266
» Approximate Tree Kernels
Sort
View
INFOCOM
2005
IEEE
15 years 8 months ago
Achieving minimum-cost multicast: a decentralized approach based on network coding
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, M...
EUROGP
2005
Springer
107views Optimization» more  EUROGP 2005»
15 years 8 months ago
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
Steven M. Gustafson, Leonardo Vanneschi
ISSADS
2005
Springer
15 years 8 months ago
Extending Databases to Precision-Controlled Retrieval of Qualitative Information
A hierarchy is an arrangement of qualitative values in a tree with certain properties. Hierarchies allow to define the confusion conf(r, s) in using qualitative value r instead of ...
Victor-Polo de Gyves, Adolfo Guzmán-Arenas,...
DMSN
2004
ACM
15 years 8 months ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
15 years 8 months ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...