Sciweavers

2517 search results - page 144 / 504
» Specifying Weak Sets
Sort
View
BMCBI
2008
146views more  BMCBI 2008»
15 years 5 months ago
nGASP - the nematode genome annotation assessment project
Background: While the C. elegans genome is extensively annotated, relatively little information is available for other Caenorhabditis species. The nematode genome annotation asses...
Avril Coghlan, Tristan J. Fiedler, Sheldon J. McKa...
BMCBI
2005
125views more  BMCBI 2005»
15 years 5 months ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 6 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
WINE
2009
Springer
194views Economy» more  WINE 2009»
16 years 6 days ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
16 years 12 hour ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew