1518 search results - page 163 / 304 » Exact and Approximate Bandwidth |
170
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
150
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
178
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
We consider Fisher and Arrow-Debreu markets under additively-separable, piecewise-linear, concave utility functions, and obtain the following results: ? For both market models, if...
146
click to vote
ICCD
2002
IEEE
16 years 3 months ago
2002
IEEE
Practical approaches for on-chip inductance extraction to obtain a sparse, stable and accurate inverse inductance matrix K are proposed. The novelty of our work is in using circui...
155
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...