425 search results - page 55 / 85 » Polynomial Time Data Reduction for Dominating Set |
ICDE
2007
IEEE
15 years 5 months ago
2007
IEEE
In this paper, we study the problem of auditing a batch of SQL queries: given a set of SQL queries that have been posed over a database, determine whether some subset of these quer...
114
click to vote
COCOON
2005
Springer
15 years 4 months ago
2005
Springer
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
DAC
1995
ACM
15 years 2 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
RECOMB
2010
Springer
14 years 9 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
EUROCAST
2005
Springer
15 years 4 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...