Sciweavers

1060 search results - page 66 / 212
» On the Discovery of Random Trees
Sort
View
GLOBECOM
2008
IEEE
15 years 4 months ago
Cooperative MAC for Rate Adaptive Randomized Distributed Space-Time Coding
—In a distributed wireless network, it is possible to employ several relays and mimic a multiple antenna transmission system. In this paper we propose a MAC layer solution that a...
Pei Liu, Yuanpeng Liu, Thanasis Korakis, Anna Scag...
TOCS
2008
107views more  TOCS 2008»
14 years 10 months ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
ECSQARU
2009
Springer
15 years 4 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
CIKM
2009
Springer
15 years 4 months ago
Dynamic in-page logging for flash-aware B-tree index
This paper presents Dynamic IPL B+ -tree (d-IPL in short) as a B+ -tree index variant for flash-based storage systems. The d-IPL B+ -tree adopts a dynamic In-Page Logging (IPL) s...
Gap-Joo Na, Sang-Won Lee, Bongki Moon
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
15 years 10 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...