51 search results - page 6 / 11 » Space- and time-efficient polynomial multiplication |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
CIKM
2009
Springer
14 years 4 days ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...