9611 search results - page 206 / 1923 » A Note on Difference Sets |
177
click to vote
CHI
2011
ACM
14 years 10 months ago
2011
ACM
Active reading, involving acts such as highlighting, writing notes, etc., is an important part of knowledge workers’ activities. Most computer-based active reading support seeks...
179
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
175
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
186
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Many algorithms have been developed for deciphering the tandem mass spectrometry (MS) data sets. They can be essentially clustered into two classes. The first performs...
128
click to vote
ARSCOM
2005
15 years 6 months ago
2005
For each integer m 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x - m or y...