Sciweavers

58 search results - page 4 / 12
» Locating a Tree in a Phylogenetic Network in Quadratic Time
Sort
View
CCCG
2003
13 years 7 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
JMLR
2010
155views more  JMLR 2010»
13 years 4 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
TMC
2008
123views more  TMC 2008»
13 years 5 months ago
Learning Adaptive Temporal Radio Maps for Signal-Strength-Based Location Estimation
In wireless networks, a client's locations can be estimated using signal strength received from signal transmitters. Static fingerprint-based techniques are commonly used for ...
Jie Yin, Qiang Yang, Lionel M. Ni
PIMRC
2008
IEEE
14 years 5 days ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
13 years 12 months ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...