845 search results - page 93 / 169 » Connecting Many-Sorted Theories |
150
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
171
click to vote
LREC
2010
15 years 7 months ago
2010
One of the essential functions of natural language is to talk about spatial relationships between objects. Linguistic constructs can express highly complex, relational structures ...
156
click to vote
OPODIS
2008
15 years 7 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
190
click to vote
IJCAI
2003
15 years 7 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
159
click to vote
AAAI
1992
15 years 7 months ago
1992
An intelligent agent uses known facts, including statistical knowledge, to assign degrees of belief to assertions it is uncertain about. We investigate three principled techniques...