Sciweavers

4128 search results - page 141 / 826
» Learning and using relational theories
Sort
View
BMCBI
2005
114views more  BMCBI 2005»
14 years 10 months ago
Extension of Lander-Waterman theory for sequencing filtered DNA libraries
Background: The degree to which conventional DNA sequencing techniques will be successful for highly repetitive genomes is unclear. Investigators are therefore considering various...
Michael C. Wendl, W. Bradley Barbazuk
TSD
2007
Springer
15 years 4 months ago
On the Relative Hardness of Clustering Corpora
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
David Pinto, Paolo Rosso
88
Voted
ICCV
2007
IEEE
16 years 4 days ago
Classification of Weakly-Labeled Data with Partial Equivalence Relations
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
Sanjiv Kumar, Henry A. Rowley
SDM
2009
SIAM
225views Data Mining» more  SDM 2009»
15 years 7 months ago
Integrated KL (K-means - Laplacian) Clustering: A New Clustering Approach by Combining Attribute Data and Pairwise Relations.
Most datasets in real applications come in from multiple sources. As a result, we often have attributes information about data objects and various pairwise relations (similarity) ...
Fei Wang, Chris H. Q. Ding, Tao Li
ICFP
2003
ACM
15 years 10 months ago
A theory of aspects
This paper define the semantics of MinAML, an idealized aspect-oriented programming language, by giving a typedirected translation from its user-friendly external language to its ...
David Walker, Steve Zdancewic, Jay Ligatti