Sciweavers

248 search results - page 27 / 50
» New On-Line Algorithms for the Page Replication Problem
Sort
View
PAKDD
2009
ACM
126views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Tree-Based Method for Classifying Websites Using Extended Hidden Markov Models
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
Majid Yazdani, Milad Eftekhar, Hassan Abolhassani
ICDM
2008
IEEE
102views Data Mining» more  ICDM 2008»
15 years 6 months ago
Mining Order-Preserving Submatrices from Data with Repeated Measurements
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...
Chun Kit Chui, Ben Kao, Kevin Y. Yip, Sau Dan Lee
BMCBI
2010
135views more  BMCBI 2010»
14 years 12 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
179
Voted
ICDE
2002
IEEE
175views Database» more  ICDE 2002»
16 years 1 months ago
Detecting Changes in XML Documents
We present a diff algorithm for XML data. This work is motivated by the support for change control in the context of the Xyleme project that is investigating dynamic warehouses ca...
Gregory Cobena, Serge Abiteboul, Amélie Mar...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 1 days ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi