Sciweavers

3708 search results - page 710 / 742
» Approximating Betweenness Centrality
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 6 days ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
ICIP
1995
IEEE
14 years 6 days ago
Error bound for multi-stage synthesis of narrow bandwidth Gabor filters
This paper develops an error bound for narrow bandwidth Gabor filters synthesized using multiple stages. It is shown that the error introduced by approximating narrow bandwidth Ga...
R. Neil Braithwaite, Bir Bhanu
AIPS
2010
13 years 11 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
AAAI
2007
13 years 11 months ago
An Investigation into Computational Recognition of Children's Jokes
bstract or nonliving entities act or are described as living. And living things gain extra benefits such as animals talking. For this reason, the standard scripts are modified to a...
Julia M. Taylor, Lawrence J. Mazlack
MAMMO
2010
Springer
13 years 10 months ago
Mammogram Compression Using Super-Resolution
Abstract. As mammography moves towards completely digital and produces prohibitive amounts of data, compression plays an increasingly important role. Although current lossless comp...
Jun Zheng, Olac Fuentes, Ming-Ying Leung, Elais Ja...