Sciweavers

7303 search results - page 190 / 1461
» Optimality for dynamic patterns
Sort
View
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 3 months ago
Longest Common Separable Pattern between Permutations
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
Mathilde Bouvel, Dominique Rossin, Stéphane...
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
16 years 3 months ago
Ordering patterns by combining opinions from multiple sources
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...
Pang-Ning Tan, Rong Jin
CIKM
2011
Springer
14 years 3 months ago
Estimating selectivity for joined RDF triple patterns
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
Hai Huang 0003, Chengfei Liu
INFOCOM
2006
IEEE
15 years 9 months ago
Optimized Stateless Broadcasting in Wireless Multi-Hop Networks
— In this paper we present a simple and stateless broadcasting protocol called Dynamic Delayed Broadcasting (DDB) which allows locally optimal broadcasting without any prior know...
Marc Heissenbüttel, Torsten Braun, Markus W&a...
ESAW
2003
Springer
15 years 8 months ago
Patterns Reuse in the PASSI Methodology
Abstract. Design patterns already proved successful in lowering the development time and number of errors of object-oriented software; now, they are, candidate to play a similar ro...
Massimo Cossentino, Luca Sabatucci, Antonio Chella