Sciweavers

580 search results - page 103 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
PR
2007
189views more  PR 2007»
13 years 7 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
TPDS
2010
143views more  TPDS 2010»
13 years 6 months ago
FIT: A Flexible, Lightweight, and Real-Time Scheduling System for Wireless Sensor Platforms
—We propose FIT, a flexible, lightweight, and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hierarchical...
Wei Dong, Chun Chen, Xue Liu, Kougen Zheng, Rui Ch...
ASPLOS
2009
ACM
14 years 8 months ago
StreamRay: a stream filtering architecture for coherent ray tracing
The wide availability of commodity graphics processors has made real-time graphics an intrinsic component of the human/computer interface. These graphics cores accelerate the z-bu...
Karthik Ramani, Christiaan P. Gribble, Al Davis
ATAL
2009
Springer
14 years 2 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
PRL
2007
180views more  PRL 2007»
13 years 7 months ago
Feature selection based on rough sets and particle swarm optimization
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
Xiangyang Wang, Jie Yang, Xiaolong Teng, Weijun Xi...