Sciweavers

316 search results - page 54 / 64
» Bounded Depth Data Trees
Sort
View
SPAA
2004
ACM
14 years 2 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
NIPS
2008
13 years 10 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
CN
2007
116views more  CN 2007»
13 years 9 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer
IS
2006
13 years 9 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
DOCENG
2006
ACM
14 years 3 months ago
Evaluating invariances in document layout functions
With the development of variable-data-driven digital presses where each document printed is potentially unique there is a need for pre-press optimization to identify material that...
Alexander J. Macdonald, David F. Brailsford, John ...