Sciweavers

2354 search results - page 425 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ICWN
2007
13 years 11 months ago
Dynamic Optimal Fragmentation with Rate Adaptation for Goodput Enhancement in WLANs
—To meet the demand for broadband wireless communication, wireless systems should work well in typical wireless environments, characterized by the path loss of the signals, multi...
Yusun Chang, Christopher P. Lee, Bongkyoung Kwon, ...
RIAO
2007
13 years 11 months ago
Discriminative Fields for Modeling Semantic Concepts in Video
According to some current thinking, a very large number of semantic concepts could provide researcher a novel way to characterize video and be utilized for video retrieval and und...
Ming-yu Chen, Alexander G. Hauptmann
MASCOTS
2001
13 years 11 months ago
Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
John R. Douceur, Roger Wattenhofer
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 11 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro