Sciweavers

2168 search results - page 36 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
ICCS
2005
Springer
14 years 1 months ago
The Development of Dependable and Survivable Grids
Abstract. Grids should not just be facilitating advances in science and engineering; rather they should also be making an impact on our daily lives by enabling sophisticated applic...
Andrew S. Grimshaw, Marty A. Humphrey, John C. Kni...
COLING
2002
13 years 7 months ago
A Novel Disambiguation Method for Unification-Based Grammars Using Probabilistic Context-Free Approximations
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...
Bernd Kiefer, Hans-Ulrich Krieger, Detlef Prescher
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 5 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
COLING
2010
13 years 2 months ago
Improving Graph-based Dependency Parsing with Decision History
This paper proposes an approach to improve graph-based dependency parsing by using decision history. We introduce a mechanism that considers short dependencies computed in the ear...
Wenliang Chen, Jun'ichi Kazama, Yoshimasa Tsuruoka...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo