Sciweavers

413 search results - page 57 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Mining compositional features for boosting
The selection of weak classifiers is critical to the success of boosting techniques. Poor weak classifiers do not perform better than random guess, thus cannot help decrease the t...
Junsong Yuan, Jiebo Luo, Ying Wu
SPAA
2012
ACM
13 years 8 months ago
A scalable framework for heterogeneous GPU-based clusters
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...
Fengguang Song, Jack Dongarra
GLOBECOM
2007
IEEE
16 years 9 days ago
Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
Jian Zhou, Xin Zhang, Laxmi N. Bhuyan, Bin Liu
DC
2010
15 years 6 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
VIZSEC
2005
Springer
15 years 11 months ago
IDS RainStorm: Visualizing IDS Alarms
The massive amount of alarm data generated from intrusion detection systems is cumbersome for network system administrators to analyze. Often, important details are overlooked and...
Kulsoom Abdullah, Christopher P. Lee, Gregory J. C...