Sciweavers

14165 search results - page 623 / 2833
» The generalized two-server problem
Sort
View
CVPR
2007
IEEE
16 years 9 months ago
Trace Ratio vs. Ratio Trace for Dimensionality Reduction
A large family of algorithms for dimensionality reduction end with solving a Trace Ratio problem in the form of arg maxW Tr(WT SpW)/Tr(WT SlW)1 , which is generally transformed in...
Huan Wang, Shuicheng Yan, Dong Xu, Xiaoou Tang, Th...
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
CIE
2007
Springer
16 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
HM
2007
Springer
137views Optimization» more  HM 2007»
16 years 1 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
FOCS
1998
IEEE
15 years 11 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello