Sciweavers

5699 search results - page 325 / 1140
» Alternating model trees
Sort
View
ICALP
2005
Springer
16 years 1 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
191
Voted
EMNLP
2007
15 years 9 months ago
Recovery of Empty Nodes in Parse Structures
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...
Denis Filimonov, Mary P. Harper
211
Voted
DBSEC
2001
154views Database» more  DBSEC 2001»
15 years 9 months ago
Regulating Access to XML documents
In this paper, our objective is to define a security model for regulating access to XML documents. Our model offers a security policy with a great expressive power. An XML documen...
Alban Gabillon, Emmanuel Bruno
204
Voted
ACL
1993
15 years 8 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
194
Voted
ENDM
2010
101views more  ENDM 2010»
15 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl