Sciweavers

4110 search results - page 438 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
TIT
2008
83views more  TIT 2008»
15 years 6 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
KAIS
2002
144views more  KAIS 2002»
15 years 6 months ago
Correlation-Based Web Document Clustering for Adaptive Web Interface Design
A great challenge for web site designers is how to ensure users' easy access to important web pages efficiently. In this paper we present a clustering-based approach to addres...
Zhong Su, Qiang Yang, HongJiang Zhang, Xiaowei Xu,...
IPPS
2010
IEEE
15 years 4 months ago
Distributed monitoring of conditional entropy for anomaly detection in streams
In this work we consider the problem of monitoring information streams for anomalies in a scalable and efficient manner. We study the problem in the context of network streams wher...
Chrisil Arackaparambil, Sergey Bratus, Joshua Brod...
BMCBI
2006
113views more  BMCBI 2006»
15 years 6 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
ICCBR
2009
Springer
15 years 4 months ago
Constraint-Based Case-Based Planning Using Weighted MAX-SAT
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
Hankui Zhuo, Qiang Yang, Lei Li