976 search results - page 93 / 196 » The Complexity of Timetable Construction Problems |
171
click to vote
EDBT
2010
ACM
15 years 11 months ago
2010
ACM
Database engines and database-centric applications have become complex software systems. Ensuring bug-free database services is therefore a very difficult task. Whenever possible...
146
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
150
click to vote
TOG
2008
15 years 6 months ago
2008
We introduce a meshless hierarchical representation for solving light transport problems. Precomputed radiance transfer (PRT) and finite elements require a discrete representation...
205
click to vote
JAPLL
2010
15 years 4 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
203
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...