1604 search results - page 113 / 321 » Approximation algorithms for developable surfaces |
123
click to vote
SIGMOD
1998
ACM
15 years 5 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
111
click to vote
IS
2008
15 years 1 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
116
click to vote
SEMWEB
2010
Springer
14 years 11 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
246
click to vote
JMLR
2012
13 years 4 months ago
2012
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
108
Voted
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...