712 search results - page 122 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
106
click to vote
SIGMOD
2010
ACM
14 years 8 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
FASE
2006
Springer
15 years 1 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
109
Voted
AI
2009
Springer
15 years 4 months ago
2009
Springer
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
143
Voted
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
122
click to vote
TRECVID
2008
14 years 11 months ago
2008
In this paper we describe our TRECVID 2008 video retrieval experiments. The MediaMill team participated in three tasks: concept detection, automatic search, and interactive search...