Sciweavers

6274 search results - page 1069 / 1255
» From query complexity to computational complexity
Sort
View
PRL
2008
161views more  PRL 2008»
15 years 4 months ago
Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
Swagatam Das, Ajith Abraham, Amit Konar
ICANN
2010
Springer
15 years 3 months ago
Autonomous Generation of Internal Representations for Associative Learning
In this contribution, we explore the possibilities of learning in large-scale, multimodal processing systems operating under real-world conditions. Using an instance of a large-sca...
Michaël Garcia Ortiz, Benjamin Dittes, Jannik...
IJHCI
2010
117views more  IJHCI 2010»
15 years 3 months ago
Avoiding Latent Design Conditions Using UI Discovery Tools
Motivation – Designers make decisions that later influence how users work with the systems that they have designed. When errors occur in use, it is tempting to focus on the acti...
Harold W. Thimbleby
INFOCOM
2010
IEEE
15 years 3 months ago
Optimal Probing for Unicast Network Delay Tomography
—Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work, we present priority probing, an optimal probing schem...
Yu Gu, Guofei Jiang, Vishal Singh, Yueping Zhang
151
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
Yunfeng Lin, Ben Liang, Baochun Li
« Prev « First page 1069 / 1255 Last » Next »