16404 search results - page 111 / 3281 » A set coverage problem |
121
click to vote
ICANN
2007
Springer
15 years 9 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
125
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
152
click to vote
ICIP
2009
IEEE
15 years 28 days ago
2009
IEEE
We investigate energy allocation strategies in image sensor networks for the purpose of maximizing the network operational lifetime. For the application scenarios that we consider...
143
click to vote
DAC
2010
ACM
15 years 1 months ago
2010
ACM
As high-level models in C and SystemC are increasingly used for verification and even design (through high-level synthesis) of electronic systems, there is a growing need for com...
123
click to vote
WWW
2009
ACM
16 years 3 months ago
2009
ACM
Understanding the intent behind a user's query can help search engine to automatically route the query to some corresponding vertical search engines to obtain particularly re...