Sciweavers

7991 search results - page 195 / 1599
» Using More Reasoning to Improve
Sort
View
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
16 years 25 days ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
BMCBI
2007
145views more  BMCBI 2007»
15 years 6 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
NAR
2002
98views more  NAR 2002»
15 years 5 months ago
Recent improvements to the SMART domain-based sequence annotation resource
SMART (Simple Modular Architecture Research Tool, http://smart.embl-heidelberg.de) is a web-based resource used for the annotation of protein domains and the analysis of domain ar...
Ivica Letunic, Leo Goodstadt, Nicholas J. Dickens,...
159
Voted
CSL
2007
Springer
15 years 6 months ago
Modeling durations of syllables using neural networks
In this paper, we propose a neural network model for predicting the durations of syllables. A four layer feedforward neural network trained with backpropagation algorithm is used ...
K. Sreenivasa Rao, B. Yegnanarayana
BIOCOMP
2008
15 years 7 months ago
Improved Segmentation Based on Probabilistic Labeling
⎯This paper presents an improved multi-object segmentation algorithm based on probabilistic labeling. First, a critical look is focused on utilizing vector calculus operator and ...
Kai-Chieh Yang, Ming-Chi Jhuang, Chun-Shun Tseng, ...