Sciweavers

478 search results - page 47 / 96
» Local Search for Computing Normal Circumstances Models
Sort
View
UAI
1996
13 years 11 months ago
Learning Equivalence Classes of Bayesian Network Structures
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
David Maxwell Chickering
CIVR
2007
Springer
247views Image Analysis» more  CIVR 2007»
14 years 4 months ago
Near-duplicate keyframe retrieval with visual keywords and semantic context
Near-duplicate keyframes (NDK) play a unique role in large-scale video search, news topic detection and tracking. In this paper, we propose a novel NDK retrieval approach by explo...
Xiao Wu, Wanlei Zhao, Chong-Wah Ngo
BMCBI
2010
183views more  BMCBI 2010»
13 years 10 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
CEC
2008
IEEE
14 years 4 months ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
SIGIR
2011
ACM
13 years 1 months ago
When documents are very long, BM25 fails!
We reveal that the Okapi BM25 retrieval function tends to overly penalize very long documents. To address this problem, we present a simple yet effective extension of BM25, namel...
Yuanhua Lv, ChengXiang Zhai