Sciweavers

2192 search results - page 248 / 439
» Algorithms for Challenging Motif Problems
Sort
View
KDD
1999
ACM
220views Data Mining» more  KDD 1999»
15 years 10 months ago
Efficient Mining of Emerging Patterns: Discovering Trends and Differences
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
Guozhu Dong, Jinyan Li
JAIR
2008
148views more  JAIR 2008»
15 years 6 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
CVPR
2011
IEEE
15 years 3 months ago
Natural Image Denoising: Optimality and Inherent Bounds
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
Anat Levin, Boaz Nadler
WWW
2011
ACM
15 years 1 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
ICTIR
2009
Springer
16 years 1 months ago
"A term is known by the company it keeps": On Selecting a Good Expansion Set in Pseudo-Relevance Feedback
Abstract. It is well known that pseudo-relevance feedback (PRF) improves the retrieval performance of Information Retrieval (IR) systems in general. However, a recent study by Cao ...
Raghavendra Udupa, Abhijit Bhole, Pushpak Bhattach...