Sciweavers

580 search results - page 80 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
ICDT
2001
ACM
124views Database» more  ICDT 2001»
14 years 1 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
AAAI
2006
13 years 10 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
CGF
1998
101views more  CGF 1998»
13 years 8 months ago
Rapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
ICCD
2008
IEEE
115views Hardware» more  ICCD 2008»
14 years 5 months ago
Techniques for increasing effective data bandwidth
—In this paper we examine techniques for increasing the effective bandwidth of the microprocessor offchip interconnect. We focus on mechanisms that are orthogonal to other techni...
Christopher Nitta, Matthew Farrens
ANSS
2007
IEEE
14 years 3 months ago
Validation of a Load Shared Integrated Network with Heterogeneous Services
As wireless networks have become more complex with packet services and sophisticated modulation techniques, validation using multidimensional Markov Chain models has become increa...
S. J. Lincke