Sciweavers

725 search results - page 99 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
ATAL
2003
Springer
15 years 2 months ago
Minimizing communication cost in a distributed Bayesian network using a decentralized MDP
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
Jiaying Shen, Victor R. Lesser, Norman Carver
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 4 days ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
CIKM
2008
Springer
14 years 11 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
WWW
2009
ACM
15 years 2 months ago
Extracting data records from the web using tag path clustering
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
Gengxin Miao, Jun'ichi Tatemura, Wang-Pin Hsiung, ...