Sciweavers

333 search results - page 43 / 67
» Speeding up moving-target search
Sort
View
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
15 years 4 months ago
SAXually Explicit Images: Finding Unusual Shapes
Among the visual features of multimedia content, shape is of particular interest because humans can often recognize objects solely on the basis of shape. Over the past three decad...
Li Wei, Eamonn J. Keogh, Xiaopeng Xi
75
Voted
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
15 years 3 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli
ISPAN
1997
IEEE
15 years 2 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
AIPS
2000
14 years 11 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau
ICML
2010
IEEE
14 years 11 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos