Sciweavers

1055 search results - page 133 / 211
» Direct learning of LPV controllers from data
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
15 years 10 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
SIGCSE
2004
ACM
101views Education» more  SIGCSE 2004»
15 years 3 months ago
Effective features of algorithm visualizations
Many algorithm visualizations have been created, but little is known about which features are most important to their success. We believe that pedagogically useful visualizations ...
Purvi Saraiya, Clifford A. Shaffer, D. Scott McCri...
IJMMS
2007
116views more  IJMMS 2007»
14 years 9 months ago
Modeling and evaluating empathy in embodied companion agents
Affective reasoning plays an increasingly important role in cognitive accounts of social interaction. Humans continuously assess one another's situational context, modify the...
Scott W. McQuiggan, James C. Lester
JITECH
2010
116views more  JITECH 2010»
14 years 8 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen