3220 search results - page 340 / 644 » Constrained Graph Processes |
191
click to vote
ICASSP
2007
IEEE
16 years 28 days ago
2007
IEEE
The goal of computational auditory scene analysis (CASA) is to create computer systems that can take as input a mixture of sounds and form packages of acoustic evidence such that ...
160
click to vote
ICIAP
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
163
click to vote
IRAL
2000
ACM
15 years 11 months ago
2000
ACM
We propose a method to create process flow graphs automatically from textbooks for cooking programs. This is realized by understanding context by narrowing down the domain to cook...
190
click to vote
DEXA
2006
Springer
15 years 10 months ago
2006
Springer
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of ...
155
click to vote
VIIP
2001
15 years 8 months ago
2001
Most of the previous multiresolution models use exclusively the triangle graphic primitive both in the data structure and in the rendering stage. Only a few models use another gra...