Sciweavers

3105 search results - page 421 / 621
» The Path-Packing Structure of Graphs
Sort
View
ENTCS
2008
98views more  ENTCS 2008»
15 years 4 months ago
A Rewriting Calculus for Multigraphs with Ports
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
Oana Andrei, Hélène Kirchner
IPL
2008
95views more  IPL 2008»
15 years 4 months ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou
145
Voted
PAMI
2006
117views more  PAMI 2006»
15 years 4 months ago
Metric Learning for Text Documents
High dimensional structured data such as text and images is often poorly understood and misrepresented in statistical modeling. The standard histogram representation suffers from ...
Guy Lebanon
JSC
2007
84views more  JSC 2007»
15 years 4 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
ACL
2010
15 years 2 months ago
Learning Script Knowledge with Web Experiments
We describe a novel approach to unsupervised learning of the events that make up a script, along with constraints on their temporal ordering. We collect naturallanguage descriptio...
Michaela Regneri, Alexander Koller, Manfred Pinkal