Sciweavers

1214 search results - page 16 / 243
» Labeling Points with Weights
Sort
View
ACL
2008
15 years 7 months ago
Sentence Simplification for Semantic Role Labeling
Parse-tree paths are commonly used to incorporate information from syntactic parses into NLP systems. These systems typically treat the paths as atomic (or nearly atomic) features...
David Vickrey, Daphne Koller
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
15 years 7 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
IEICET
2011
15 years 17 days ago
Minimum Spanning Tree Problem with Label Selection
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
Akio Fujiyoshi, Masakazu Suzuki
COMPGEOM
2007
ACM
15 years 9 months ago
There are not too many magic configurations
A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum o...
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom...
ECCV
2010
Springer
15 years 10 months ago
Learning What and How of Contextual Models for Scene Labeling
We present a data-driven approach to predict the importance of edges and construct a Markov network for image analysis based on statistical models of global and local image feature...