Sciweavers

15485 search results - page 40 / 3097
» Computing Optimal Subsets
Sort
View
IANDC
2008
80views more  IANDC 2008»
13 years 7 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
CVPR
2012
IEEE
11 years 10 months ago
Seeing double without confusion: Structure-from-motion in highly ambiguous scenes
3D reconstruction from an unordered set of images may fail due to incorrect epipolar geometries (EG) between image pairs arising from ambiguous feature correspondences. Previous m...
Nianjuan Jiang, Ping Tan, Loong Fah Cheong
CVPR
2007
IEEE
14 years 9 months ago
P3 & Beyond: Solving Energies with Higher Order Cliques
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr
DLOG
2001
13 years 9 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
APAL
2007
72views more  APAL 2007»
13 years 7 months ago
On definable filters in computably enumerable degrees
Based on a result of Nies on definability the upper semilattice of computably enumerable degrees (denoted by R), we find that in R filters generated by definable subsets are al...
Wei Wang, Decheng Ding