Sciweavers

477 search results - page 89 / 96
» Removing even crossings
Sort
View
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
CSREAESA
2008
13 years 9 months ago
Achieving Industrial Strength Timing Predictions of Embedded System Behavior
This paper discusses why the extensive scientific results on predicting embedded systems temporal behavior never, or very seldom, reaches the industrial community. We also point ou...
Mikael Nolin, Jukka Mäki-Turja, Kaj Hänn...
DAGSTUHL
2006
13 years 9 months ago
Taming Dynamic and Selfish Peers
This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degre...
Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Rog...
CIDR
2003
164views Algorithms» more  CIDR 2003»
13 years 8 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 8 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis