4865 search results - page 516 / 973 » The Complexity of Graph Connectivity |
380
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
194
click to vote
XSYM
2004
Springer
16 years 11 days ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
186
click to vote
MSE
2002
IEEE
15 years 12 months ago
2002
IEEE
In this paper we describe an authoring environment which allows the author to set up and test a complex multimedia presentation by defining the synchronization relationships amon...
150
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
155
click to vote
NAACL
2003
15 years 8 months ago
2003
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...