Sciweavers

1957 search results - page 304 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
13 years 8 days ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
TIT
2002
62views more  TIT 2002»
14 years 9 months ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon
VLDB
2006
ACM
171views Database» more  VLDB 2006»
15 years 10 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
15 years 10 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
DAS
2010
Springer
15 years 1 months ago
Nearest neighbor based collection OCR
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha