Sciweavers

340 search results - page 31 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
CVPR
2011
IEEE
13 years 5 months ago
Sparsity-based Image Denoising via Dictionary Learning and Structural Clustering
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts t...
Weisheng Dong, Xin Li
DLOG
2007
13 years 10 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 7 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
14 years 26 days ago
Study Diploid System by a Hamiltonian Cycle Problem Algorithm
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
Dong Xianghui, Ruwei Dai
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 8 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl