Sciweavers

5451 search results - page 14 / 1091
» On very high degrees
Sort
View
EDBT
2000
ACM
14 years 2 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
RECOMB
2005
Springer
14 years 10 months ago
Very Low Power to Detect Asymmetric Divergence of Duplicated Genes
Abstract. Asymmetric functional divergence of paralogues is a key aspect of the traditional model of evolution following duplication. If one gene continues to perform the ancestral...
Cathal Seoighe, Konrad Scheffler
WSCG
2004
137views more  WSCG 2004»
13 years 11 months ago
Fractal Image Compression for Efficient Texture Mapping
Texture mapping has traditionally been used to add visual realism to computer graphics images. In the paper we propose an alternative technique for image texture handling. We use ...
Jerzy Stachera, Slawomir S. Nikiel
CIE
2005
Springer
14 years 3 months ago
On the Turing Degrees of Divergence Bounded Computable Reals
The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of ∆0 2-reals which have very interesting computability-theoretical as...
Robert Rettinger, Xizhong Zheng
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 3 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...