Sciweavers

1216 search results - page 164 / 244
» Predicting relative performance of classifiers from samples
Sort
View
HIPC
2005
Springer
14 years 2 months ago
Application of Reduce Order Modeling to Time Parallelization
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
Ashok Srinivasan, Yanan Yu, Namas Chandra
TIP
2010
182views more  TIP 2010»
13 years 3 months ago
Flexible Manifold Embedding: A Framework for Semi-Supervised and Unsupervised Dimension Reduction
We propose a unified manifold learning framework for semi-supervised and unsupervised dimension reduction by employing a simple but effective linear regression function to map the ...
Feiping Nie, Dong Xu, Ivor Wai-Hung Tsang, Changsh...
BMCBI
2007
116views more  BMCBI 2007»
13 years 9 months ago
Ranked Adjusted Rand: integrating distance and partition information in a measure of clustering agreement
Background: Biological information is commonly used to cluster or classify entities of interest such as genes, conditions, species or samples. However, different sources of data c...
Francisco R. Pinto, João A. Carriço,...
AUTOMATICA
2005
91views more  AUTOMATICA 2005»
13 years 8 months ago
Lyapunov-based continuous-time nonlinear controller redesign for sampled-data implementation
: Given a continuous-time controller and a Lyapunov function that shows global asymptotic stability for the closed loop system, we provide several results for modification of the c...
Dragan Nesic, Lars Grüne
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
14 years 2 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan