Sciweavers

1845 search results - page 348 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 8 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
IJSNET
2006
107views more  IJSNET 2006»
13 years 8 months ago
In-network aggregation trade-offs for data collection in wireless sensor networks
This paper explores in-network aggregation as a power-efficient mechanism for collecting data in wireless sensor networks. In particular, we focus on sensor network scenarios wher...
Ignacio Solis, Katia Obraczka
JNW
2008
117views more  JNW 2008»
13 years 8 months ago
An Intelligent Multicast Ad-hoc On demand Distance Vector Protocol for MANETs
-Recently multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication. This includes application such as multipoint data disseminat...
E. Baburaj, V. Vasudevan
JCB
2006
123views more  JCB 2006»
13 years 8 months ago
Reconstructing Ancestral Haplotypes with a Dictionary Model
We propose a dictionary model for haplotypes. According to the model, a haplotype is constructed by randomly concatenating haplotype segments from a given dictionary of segments. ...
Kristin L. Ayers, Chiara Sabatti, Kenneth Lange