4843 search results - page 267 / 969 » The Shortcut Problem - Complexity and Approximation |
147
Voted
PODS
1999
ACM
15 years 8 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
123
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
137
Voted
JCP
2007
15 years 3 months ago
2007
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
151
click to vote
TROB
2010
15 years 2 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
142
click to vote
SIGMOD
2002
ACM
16 years 3 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...