Sciweavers

2526 search results - page 64 / 506
» A New Algorithm for Answer Set Computation
Sort
View
BMCBI
2007
164views more  BMCBI 2007»
13 years 9 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
COLING
2010
13 years 4 months ago
Multi-Document Summarization via the Minimum Dominating Set
Multi-document summarization aims to distill the most important information from a set of documents to generate a compressed summary. Given a sentence graph generated from a set o...
Chao Shen, Tao Li
MIDDLEWARE
2007
Springer
14 years 3 months ago
New Worker-Centric Scheduling Strategies for Data-Intensive Grid Applications
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
Steven Y. Ko, Ramsés Morales, Indranil Gupt...
TAMC
2010
Springer
13 years 7 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Johannes Uhlmann, Mathias Weller
JMLR
2006
93views more  JMLR 2006»
13 years 9 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg