Sciweavers

876 search results - page 35 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
ICASSP
2011
IEEE
13 years 2 months ago
Multi-cue based multi-target tracking using online random forests
Discriminative tracking has become popular tracking methods due to their descriptive power for foreground/background separation. Among these methods, online random forest is recen...
Xinchu Shi, Xiaoqin Zhang, Yang Liu, Weiming Hu, H...
LREC
2010
199views Education» more  LREC 2010»
14 years 6 days ago
A Random Graph Walk based Approach to Computing Semantic Relatedness Using Knowledge from Wikipedia
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...
Ziqi Zhang, Anna Lisa Gentile, Lei Xia, José...
ECRTS
2009
IEEE
13 years 8 months ago
Using Randomized Caches in Probabilistic Real-Time Systems
While hardware caches are generally effective at improving application performance, they greatly complicate performance prediction. Slight changes in memory layout or data access p...
Eduardo Quiñones, Emery D. Berger, Guillem ...
IWCMC
2010
ACM
14 years 21 days ago
On the use of random neural networks for traffic matrix estimation in large-scale IP networks
Despite a large body of literature and methods devoted to the Traffic Matrix (TM) estimation problem, the inference of traffic flows volume from aggregated data still represents a ...
Pedro Casas, Sandrine Vaton
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 9 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha