Sciweavers

1697 search results - page 165 / 340
» On Bayesian Case Matching
Sort
View
AIRS
2004
Springer
15 years 6 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
111
Voted
ACIIDS
2010
IEEE
172views Database» more  ACIIDS 2010»
15 years 5 months ago
Automatic Lexical Annotation Applied to the SCARLET Ontology Matcher
This paper proposes lexical annotation as an effective method to solve the ambiguity problems that affect ontology matchers. Lexical annotation associates to each ontology elemen...
Laura Po, Sonia Bergamaschi
ROBOCUP
2001
Springer
96views Robotics» more  ROBOCUP 2001»
15 years 5 months ago
Strategy Learning for a Team in Adversary Environments
Team strategy acquisition is one of the most important issues of multiagent systems, especially in an adversary environment. RoboCup has been providing such an environment for AI a...
Yasutake Takahashi, Takashi Tamura, Minoru Asada
ISMIR
2000
Springer
176views Music» more  ISMIR 2000»
15 years 4 months ago
SEMEX - An efficient Music Retrieval Prototype
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
Kjell Lemström, S. Perttu
124
Voted
ECCV
2010
Springer
15 years 2 months ago
Descriptor Learning for Efficient Retrieval
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...