773 search results - page 93 / 155 » Traversing the Machining Graph |
139
click to vote
IJCAI
2003
15 years 3 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...
122
click to vote
KDD
2009
ACM
15 years 8 months ago
2009
ACM
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
170
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
122
click to vote
EUROGP
2007
Springer
15 years 8 months ago
2007
Springer
This paper reports on the results of a preliminary study conducted to evaluate genetic programming (GP) as a means of evolving finite state transducers. A genetic programming syste...
107
click to vote
ECML
2007
Springer
15 years 5 months ago
2007
Springer
Recently, a successful extension of Principal Component Analysis for structured input, such as sequences, trees, and graphs, has been proposed. This allows the embedding of discret...