Sciweavers

559 search results - page 67 / 112
» Augmented Marked Graphs
Sort
View
NAACL
2003
13 years 11 months ago
Unsupervised Learning of Morphology for English and Inuktitut
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...
Howard Johnson, Joel D. Martin
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
13 years 11 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
ECEASST
2008
95views more  ECEASST 2008»
13 years 10 months ago
A Static Layout Algorithm for DiaMeta
Abstract: The diagram editor generator framework DIAMETA utilizes meta-modelbased language specifications and supports free-hand as well as structured editing. In this paper we pre...
Sonja Maier, Mark Minas
ENTCS
2002
90views more  ENTCS 2002»
13 years 9 months ago
Specifying Graph-like Diagrams with DIAGEN
ended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented a...
Mark Minas
CVPR
2010
IEEE
1171views Computer Vision» more  CVPR 2010»
14 years 6 months ago
Geodesic Star Convexity for Interactive Image Segmentation
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...