Sciweavers

283 search results - page 30 / 57
» On the Accuracy and Running Time of GSAT
Sort
View
BIBE
2003
IEEE
15 years 5 months ago
An Investigation of Phylogenetic Likelihood Methods
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
Tiffani L. Williams, Bernard M. E. Moret
NIPS
2007
15 years 1 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
KDD
2012
ACM
178views Data Mining» more  KDD 2012»
13 years 2 months ago
Mining emerging patterns by streaming feature selection
Building an accurate emerging pattern classifier with a highdimensional dataset is a challenging issue. The problem becomes even more difficult if the whole feature space is unava...
Kui Yu, Wei Ding 0003, Dan A. Simovici, Xindong Wu
INFOCOM
2003
IEEE
15 years 5 months ago
Chaotic Maps as Parsimonious Bit Error Models of Wireless Channels
Abstract—The error patterns of a wireless digital communication channel can be described by looking at consecutively correct or erroneous bits (runs and bursts) and at the distri...
Andreas Köpke, Andreas Willig, Holger Karl
SC
2005
ACM
15 years 5 months ago
The MHETA Execution Model for Heterogeneous Clusters
The availability of inexpensive “off the shelf” machines increases the likelihood that parallel programs run on heterogeneous clusters of machines. These programs are increasi...
Mario Nakazawa, David K. Lowenthal, Wenduo Zhou