425 search results - page 59 / 85 » Polynomial Time Data Reduction for Dominating Set |
100
click to vote
ECOOP
2012
Springer
12 years 12 months ago
2012
Springer
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...
92
Voted
JAR
2006
14 years 9 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
83
Voted
TAMC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...