1486 search results - page 104 / 298 » Algorithms for two-box covering |
122
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
121
Voted
WADS
2007
Springer
15 years 10 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
119
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
The paper presents an approach for the anomaly detection problem based on principles of immune systems. Flexibility and efficiency of the anomaly detection system are achieved by ...
124
click to vote
FAW
2008
Springer
15 years 5 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
116
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
We consider the problem of visualizing the evolution of tags within the Flickr (flickr.com) online image sharing community. Any user of the Flickr service may append a tag to any ...