Sciweavers

1566 search results - page 150 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
CPAIOR
2006
Springer
13 years 11 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
BMCBI
2008
122views more  BMCBI 2008»
13 years 8 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
14 years 8 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
BIBM
2009
IEEE
118views Bioinformatics» more  BIBM 2009»
14 years 2 days ago
Inexact Local Alignment Search over Suffix Arrays
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
Mohammadreza Ghodsi, Mihai Pop
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 5 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong