583 search results - page 4 / 117 » On small blocking sets and their linearity |
CODES
2003
IEEE
15 years 4 months ago
2003
IEEE
We describe our first efforts to develop a set of off-the-shelf hardware components that ordinary people could connect to build a simple but useful class of embedded systems. The ...
IJFCS
2007
14 years 11 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
CVPR
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper presents region moments, a class of appearance descriptors based on image moments applied to a pool of image features. A careful design of the moments and the image fea...
106
click to vote
UAI
2008
15 years 12 days ago
2008
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one...
FCT
2007
Springer
15 years 5 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...