Sciweavers

840 search results - page 85 / 168
» The Complexity of the Extended GCD Problem
Sort
View
ECCC
2010
117views more  ECCC 2010»
13 years 6 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
DBPL
1995
Springer
106views Database» more  DBPL 1995»
13 years 11 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
BMCBI
2008
105views more  BMCBI 2008»
13 years 8 months ago
A gene pattern mining algorithm using interchangeable gene sets for prokaryotes
Background: Mining gene patterns that are common to multiple genomes is an important biological problem, which can lead us to novel biological insights. When family classification...
Meng Hu, Kwangmin Choi, Wei Su, Sun Kim, Jiong Yan...
CCECE
2009
IEEE
14 years 2 months ago
Estimation of boundary properties using stochastic differential equations
The inverse diffusion problems deal with the estimation of many crucial parameters such as the diffusion coefficient, source properties, and boundary conditions. Such algorithms ...
Ashraf Atalla, Aleksandar Jeremic
CVPR
2007
IEEE
14 years 10 months ago
Optimal Dimensionality Discriminant Analysis and Its Application to Image Recognition
Dimensionality reduction is an important issue when facing high-dimensional data. For supervised dimensionality reduction, Linear Discriminant Analysis (LDA) is one of the most po...
Feiping Nie, Shiming Xiang, Yangqiu Song, Changshu...