4926 search results - page 193 / 986 » Two Graph Algorithms On an Associative Computing Model |
195
click to vote
AAAI
2012
13 years 8 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
178
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 ...
164
click to vote
FOCS
2007
IEEE
16 years 18 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
164
click to vote
CLIMA
2004
15 years 7 months ago
2004
Apriori Stochastic Dependency Detection (ASDD) is an algorithm for fast induction of stochastic logic rules from a database of observations made by an agent situated in an environm...
201
click to vote
MOBICOM
2012
ACM
13 years 8 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...