623 search results - page 107 / 125 » Efficient Algorithms for Two Generalized 2-Median Problems o... |
RECOMB
1998
Springer
13 years 11 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
CASES
2007
ACM
13 years 11 months ago
2007
ACM
Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots,...
AI
2004
Springer
13 years 7 months ago
2004
Springer
al Abstraction Luca Chittaro and Roberto Ranon Department of Mathematics and Computer Science, University of Udine, via delle Scienze 206, 33100 Udine, Italy ion has been advocat...
SMA
2008
ACM
13 years 7 months ago
2008
ACM
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...