Sciweavers

2492 search results - page 17 / 499
» On the General Signature Trees
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
ICML
2005
IEEE
14 years 8 months ago
Generalized skewing for functions with continuous and nominal attributes
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
Soumya Ray, David Page
FSTTCS
2001
Springer
14 years 1 days ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
CSB
2003
IEEE
110views Bioinformatics» more  CSB 2003»
14 years 25 days ago
Prokaryote Phylogeny without Sequence Alignment: From Avoidance Signature to Composition Distance
A new and essentially simple method to reconstruct prokaryotic phylogenetic trees from their complete genome data without using sequence alignment is proposed. It is based on the ...
Bailin Hao, Ji Qi
IRI
2008
IEEE
14 years 1 months ago
Modeling and synthesis of service composition using tree automata
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
Ken Q. Pu, Ying Zhu