116 search results - page 18 / 24 » Near optimal online algorithms and fast approximation algori... |
JMM2
2007
13 years 7 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
SIGMOD
1999
ACM
13 years 11 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
MOBICOM
2004
ACM
14 years 28 days ago
2004
ACM
—The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth allocation among users. We argue that the load ...
INFOCOM
2003
IEEE
14 years 23 days ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
JMLR
2006
13 years 7 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...