Sciweavers

943 search results - page 93 / 189
» How should data structures and algorithms be taught
Sort
View
121
Voted
TOCHI
1998
89views more  TOCHI 1998»
15 years 2 months ago
Using Metalevel Techniques in a Flexible Toolkit for CSCW Applications
Ideally, software toolkits for collaborative applications should provide generic, reusable components, applicable in a wide range of circumstances, which software developers can as...
Paul Dourish
133
Voted
ICML
2004
IEEE
16 years 3 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
113
Voted
ECCV
2000
Springer
16 years 4 months ago
Colour by Correlation in a Three-Dimensional Colour Space
We improve the promising Colour by Correlation method for computational colour constancy by modifying it to work in a three dimensional colour space. The previous version of the al...
Kobus Barnard, Lindsay Martin, Brian V. Funt
141
Voted
BMCBI
2010
243views more  BMCBI 2010»
15 years 2 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
120
Voted
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
15 years 10 days ago
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
Jennifer Neville, Brian Gallagher, Tina Eliassi-Ra...