Sciweavers

5962 search results - page 345 / 1193
» Efficient Clustering for Orders
Sort
View
IJDMB
2006
90views more  IJDMB 2006»
15 years 6 months ago
An efficient motif discovery algorithm with unknown motif length and number of binding sites
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...
Henry C. M. Leung, Francis Y. L. Chin
TC
2008
15 years 6 months ago
Efficient Deadline-Based QoS Algorithms for High-Performance Networks
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because, in those environments, there are different traffic types, ea...
Alejandro Martínez-Vicente, George Apostolo...
185
Voted
TOG
2008
137views more  TOG 2008»
15 years 6 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...
ACL
2010
15 years 4 months ago
Efficient Staggered Decoding for Sequence Labeling
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
Nobuhiro Kaji, Yasuhiro Fujiwara, Naoki Yoshinaga,...
174
Voted
EMNLP
2010
15 years 4 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura