Sciweavers

3146 search results - page 159 / 630
» Efficient Consequence Finding
Sort
View
ICCV
2005
IEEE
16 years 7 months ago
Avoiding the "Streetlight Effect": Tracking by Exploring Likelihood Modes
Classic methods for Bayesian inference effectively constrain search to lie within regions of significant probability of the temporal prior. This is efficient with an accurate dyna...
David Demirdjian, Leonid Taycher, Gregory Shakhnar...
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 5 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
IWVF
2001
Springer
15 years 9 months ago
Computational Surface Flattening: A Voxel-Based Approach
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
Ruth Grossmann, Nahum Kiryati, Ron Kimmel
ASAP
2000
IEEE
142views Hardware» more  ASAP 2000»
15 years 9 months ago
Contention-Conscious Transaction Ordering in Embedded Multiprocessors
This paper explores the problem of efficiently ordering interprocessor communication operations in statically-scheduled multiprocessors for iterative dataflow graphs. In most digi...
Mukul Khandelia, Shuvra S. Bhattacharyya
ICDCS
1998
IEEE
15 years 9 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen