Sciweavers

8413 search results - page 332 / 1683
» Ordering Problem Subgoals
Sort
View
ECAI
2010
Springer
15 years 4 months ago
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
Rafael Peñaloza, Baris Sertkaya
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
15 years 4 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
16 years 6 days ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
16 years 7 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
CVPR
2011
IEEE
15 years 2 months ago
Particle Filter with State Permutations for Solving Image Jigsaw Puzzles
We deal with an image jigsaw puzzle problem, which is defined as reconstructing an image from a set of square and non-overlapping image patches. It is known that a general instan...
Xingwei Yang, Nagesh Adluru, LonginJan Latecki