5169 search results - page 827 / 1034 » Locality approximation using time |
142
click to vote
DASFAA
2003
IEEE
15 years 9 months ago
2003
IEEE
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
116
click to vote
ISPD
1997
ACM
15 years 8 months ago
1997
ACM
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
159
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
215
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
149
click to vote
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...