Sciweavers

13603 search results - page 130 / 2721
» On the Complexity of Computing Treelength
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Bayesian topic models for describing computer network behaviors
We consider the use of Bayesian topic models in the analysis of computer network traffic. Our approach utilizes latent Dirichlet allocation and time-varying dynamic latent Dirich...
Christopher Cramer, Lawrence Carin
PRESENCE
1998
98views more  PRESENCE 1998»
13 years 9 months ago
The Virtual Venue: User-Computer Interaction in Information-Rich Virtual Environments
We present a virtual environment application that allows users to access embedded information within an immersive virtual space. Due to the richness and complexity of this environ...
Doug A. Bowman, Larry F. Hodges, Jay David Bolter
IDT
2010
138views more  IDT 2010»
13 years 8 months ago
Challenging computer software frontiers and the human resistance to change
This paper examines the driving and opposing forces that are governing the current paradigm shift from a data-processing information technology environment without software intell...
Jens Pohl
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 4 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
ICASSP
2011
IEEE
13 years 1 months ago
New radix-based FHT algorithm for computing the discrete Hartley transform
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
Monir Taha Hamood, Said Boussakta