Sciweavers

1059 search results - page 86 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
15 years 3 months ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
15 years 10 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
VALUETOOLS
2006
ACM
15 years 3 months ago
Splitting with weight windows to control the likelihood ratio in importance sampling
Importance sampling (IS) is the most widely used efficiency improvement method for rare-event simulation. When estimating the probability of a rare event, the IS estimator is the ...
Pierre L'Ecuyer, Bruno Tuffin
COLT
2003
Springer
15 years 3 months ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio
ICASSP
2009
IEEE
15 years 4 months ago
Adaptive coding of images via multiresolution ICA
Multiresolution (MR) representations have been very successful in image encoding, due to both their algorithmic performance and coding efficiency. However these transforms are ...
Doru-Cristian Balcan, Michael S. Lewicki