Sciweavers

2190 search results - page 388 / 438
» Learning with the Set Covering Machine
Sort
View
COLT
2005
Springer
14 years 1 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
BMCBI
2007
145views more  BMCBI 2007»
13 years 7 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...
BMCBI
2005
134views more  BMCBI 2005»
13 years 7 months ago
Systematic feature evaluation for gene name recognition
In task 1A of the BioCreAtIvE evaluation, systems had to be devised that recognize words and phrases forming gene or protein names in natural language sentences. We approach this ...
Jörg Hakenberg, Steffen Bickel, Conrad Plake,...
TOG
2008
98views more  TOG 2008»
13 years 7 months ago
Upright orientation of man-made objects
Humans usually associate an upright orientation with objects, placing them in a way that they are most commonly seen in our surroundings. While it is an open challenge to recover ...
Hongbo Fu, Daniel Cohen-Or, Gideon Dror, Alla Shef...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 6 months ago
Viewpoints: A high-performance high-dimensional exploratory data analysis tool
Scientific data sets continue to increase in both size and complexity. In the past, dedicated graphics systems at supercomputing centers were required to visualize large data sets,...
Paul R. Gazis, C. Levit, Michael J. Way