Sciweavers

68 search results - page 13 / 14
» Deriving class instances for datatypes
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
13 years 8 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
DLOG
2008
13 years 7 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
SDM
2010
SIAM
144views Data Mining» more  SDM 2010»
13 years 6 months ago
Predictive Modeling with Heterogeneous Sources
Lack of labeled training examples is a common problem for many applications. In the same time, there is usually an abundance of labeled data from related tasks. But they have diff...
Xiaoxiao Shi, Qi Liu, Wei Fan, Qiang Yang, Philip ...
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 6 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
IJCV
2006
112views more  IJCV 2006»
13 years 5 months ago
Non-Single Viewpoint Catadioptric Cameras: Geometry and Analysis
Conventional vision systems and algorithms assume the imaging system to have a single viewpoint. However, these imaging systems need not always maintain a single viewpoint. For ins...
Rahul Swaminathan, Michael D. Grossberg, Shree K. ...