Sciweavers

92 search results - page 2 / 19
» Random non-cupping revisited
Sort
View
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 5 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 4 months ago
Random Projection Trees Revisited
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
Aman Dhesi, Purushottam Kar
MOBICOM
2004
ACM
13 years 10 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
CVPR
2009
IEEE
14 years 11 months ago
A Revisit of Generative Model for Automatic Image Annotation using Markov Random Fields
Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many we...
Yu Xiang (Fudan University), Xiangdong Zhou (Fudan...
ICASSP
2009
IEEE
13 years 11 months ago
Statistics for complex random variables revisited
Jan Eriksson, Esa Ollila, Visa Koivunen