1658 search results - page 16 / 332 » Learning Unknown Graphs |
98
Voted
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
We present in this paper a method to insert new concepts in an existing information extraction system based on a conceptual graph architecture. We use verb patterns as conceptual s...
102
click to vote
COCOON
2008
Springer
15 years 3 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
105
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
103
click to vote
COMBINATORICA
2010
14 years 8 months ago
2010
We prove that every rayless graph has an unfriendly partition.
99
Voted
OPODIS
2007
15 years 3 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...