Sciweavers

2297 search results - page 103 / 460
» Production of Large Computer Programs
Sort
View
STACS
2005
Springer
14 years 1 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
SIGMOD
2004
ACM
88views Database» more  SIGMOD 2004»
14 years 8 months ago
Using Reasoning to Guide Annotation with Gene Ontology Terms in GOAT
High-quality annotation of biological data is central to bioinformatics. Annotation using terms from ontologies provides reliable computational access to data. The Gene Ontology (...
Michael Bada, Daniele Turi, Robin McEntire, Robert...
JILP
2000
165views more  JILP 2000»
13 years 8 months ago
BMAT - A Binary Matching Tool for Stale Profile Propagation
A major challenge of applying profile-based optimization on large real-world applications is how to capture adequate profile information. A large program, especially a GUI-based a...
Zheng Wang, Ken Pierce, Scott McFarling
DAGSTUHL
2008
13 years 9 months ago
Fast (Parallel) Dense Linear System Solvers in C-XSC Using Error Free Transformations and BLAS
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...
Walter Krämer, Michael Zimmer
AAAI
2011
12 years 8 months ago
Fast Newton-CG Method for Batch Learning of Conditional Random Fields
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
Yuta Tsuboi, Yuya Unno, Hisashi Kashima, Naoaki Ok...