Sciweavers

17 search results - page 2 / 4
» Embedding Complete Binary Trees into Star Networks
Sort
View
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
14 years 1 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
DAC
2002
ACM
14 years 8 months ago
A fast on-chip profiler memory
Profiling an application executing on a microprocessor is part of the solution to numerous software and hardware optimization and design automation problems. Most current profilin...
Roman L. Lysecky, Susan Cotterell, Frank Vahid
COCOON
2009
Springer
14 years 2 months ago
Online Tree Node Assignment with Resource Augmentation
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...
ICCCN
2008
IEEE
14 years 2 months ago
Massively Parallel Anomaly Detection in Online Network Measurement
—Detecting anomalies during the operation of a network is an important aspect of network management and security. Recent development of high-performance embedded processing syste...
Shashank Shanbhag, Tilman Wolf
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
13 years 11 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu