2520 search results - page 96 / 504 » The complexity of approximating entropy |
DAGSTUHL
2004
14 years 11 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
JMLR
2006
14 years 10 months ago
2006
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
CSE
2008
IEEE
15 years 3 days ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
FOCS
1993
IEEE
15 years 2 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...