Sciweavers

1945 search results - page 87 / 389
» Speeding up Serpent
Sort
View
TOSN
2011
116views more  TOSN 2011»
14 years 6 months ago
A model framework for greedy routing in a sensor network with a stochastic power scheme
A stochastic model is formulated and analyzed to study the advancements of messages under greedy routing in a sensor network with a power-saving scheme. The aim of this model is g...
Holger Paul Keeler, Peter G. Taylor
TVCG
2011
152views more  TVCG 2011»
14 years 6 months ago
Automated Analytical Methods to Support Visual Exploration of High-Dimensional Data
—Visual exploration of multivariate data typically requires projection onto lower-dimensional representations. The number of possible representations grows rapidly with the numbe...
Andrada Tatu, Georgia Albuquerque, Martin Eisemann...
EVI
2010
156views more  EVI 2010»
14 years 6 months ago
GPU implementation of a road sign detector based on particle swarm optimization
Road Sign Detection is a major goal of the Advanced Driving Assistance Systems. Most published work on this problem share the same approach by which signs are first detected and th...
Luca Mussi, Stefano Cagnoni, Elena Cardarelli, Fab...
ICASSP
2010
IEEE
14 years 6 months ago
Search error risk minimization in Viterbi beam search for speech recognition
This paper proposes a method to optimize Viterbi beam search based on search error risk minimization in large vocabulary continuous speech recognition (LVCSR). Most speech recogni...
Takaaki Hori, Shinji Watanabe, Atsushi Nakamura
JMLR
2010
108views more  JMLR 2010»
14 years 6 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...