Sciweavers

2083 search results - page 175 / 417
» Perception and Experience in Problem Solving
Sort
View
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
16 years 26 days ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
ICIP
2010
IEEE
15 years 3 months ago
Morphological wavelet transform with adaptive dyadic structures
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
Zhen James Xiang, Peter J. Ramadge
JMLR
2010
118views more  JMLR 2010»
15 years 25 days ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
ICML
2004
IEEE
16 years 6 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik
ICML
2003
IEEE
16 years 6 months ago
Learning with Positive and Unlabeled Examples Using Weighted Logistic Regression
The problem of learning with positive and unlabeled examples arises frequently in retrieval applications. We transform the problem into a problem of learning with noise by labelin...
Wee Sun Lee, Bing Liu