3341 search results - page 577 / 669 » On Bounded Queries and Approximation |
ICGI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
101
click to vote
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
101
click to vote
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
PIMRC
2010
IEEE
14 years 7 months ago
2010
IEEE
An important parameter in determining a spectrum sharing opportunity is the level of interference power that secondary users may generate towards primary users. It is indicated in ...
100
click to vote
WAW
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...