Sciweavers

306 search results - page 44 / 62
» Parameterized matching with mismatches
Sort
View
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
CSL
2006
Springer
13 years 8 months ago
Adaptation of maximum entropy capitalizer: Little data can help a lot
A novel technique for maximum "a posteriori" (MAP) adaptation of maximum entropy (MaxEnt) and maximum entropy Markov models (MEMM) is presented. The technique is applied...
Ciprian Chelba, Alex Acero
CVGIP
2006
163views more  CVGIP 2006»
13 years 8 months ago
SVD-matching using SIFT features
The paper tackles the problem of feature points matching between pair of images of the same scene. This is a key problem in computer vision. The method we discuss here is a versio...
Elisabetta Delponte, Francesco Isgrò, Franc...
JSA
2006
113views more  JSA 2006»
13 years 8 months ago
A power-efficient TCAM architecture for network forwarding tables
Stringent memory access and search speed requirements are two of the main bottlenecks in wire speed processing. Most viable search engines are implemented in content addressable m...
Taskin Koçak, Faysal Basci
PRL
2006
119views more  PRL 2006»
13 years 7 months ago
Exploring the use of latent topical information for statistical Chinese spoken document retrieval
Information retrieval which aims to provide people with easy access to all kinds of information is now becoming more and more emphasized. However, most approaches to information r...
Berlin Chen