Sciweavers

962 search results - page 83 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
TSP
2010
14 years 10 months ago
Adaptive precoding for downstream crosstalk precancelation in DSL systems using sign-error feedback
The performance of many very high bit rate digital subscriber line (VDSL) systems is limited by the effects of crosstalk among the wires in a bundle. For the downstream, a precoder...
Jérôme Louveaux, Alle-Jan van der Vee...
111
Voted
MOC
2000
173views more  MOC 2000»
15 years 3 months ago
Computation of Gauss-Kronrod quadrature rules
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
Daniela Calvetti, Gene H. Golub, William B. Gragg,...
CIKM
2005
Springer
15 years 9 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
CVPR
2004
IEEE
16 years 6 months ago
Feature Selection for Classifying High-Dimensional Numerical Data
Classifying high-dimensional numerical data is a very challenging problem. In high dimensional feature spaces, the performance of supervised learning methods suffer from the curse...
Yimin Wu, Aidong Zhang
SIGMOD
2009
ACM
114views Database» more  SIGMOD 2009»
16 years 4 months ago
A framework for testing query transformation rules
In order to enable extensibility, modern query optimizers typically leverage a transformation rule based framework. Testing individual rule correctness as well as correctness of r...
Hicham G. Elmongui, Vivek R. Narasayya, Ravishanka...