1115 search results - page 110 / 223 » Separating Shape Graphs |
94
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
123
click to vote
DAM
2000
15 years 19 days ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
110
click to vote
SIBGRAPI
2008
IEEE
15 years 7 months ago
2008
IEEE
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
IPCO
2007
15 years 2 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
106
click to vote
NAACL
2007
15 years 2 months ago
2007
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...