Sciweavers

493 search results - page 47 / 99
» The oracle penalty method
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
MP
2002
195views more  MP 2002»
13 years 8 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
CIKM
2001
Springer
14 years 1 months ago
Index Filtering and View Materialization in ROLAP Environment
Using materialized view to accelerate OLAP queries is one of the most common methods used in ROLAP systems. However, high storage and computation cost make this method very diffic...
Shi Guang Qiu, Tok Wang Ling
COMAD
2008
13 years 10 months ago
Native Multidimensional Indexing in Relational Databases
In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes...
David Hoksza, Tomás Skopal
DAC
2001
ACM
14 years 10 months ago
High-Quality Operation Binding for Clustered VLIW Datapaths
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...