853 search results - page 10 / 171 » Are many small sets explicitly small |
159
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
162
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
IPM
2008
15 years 5 months ago
2008
An h-type index is proposed which depends on the obtained citations of articles belonging to the h-core. This weighted h-index, denoted as hw, is presented in a continuous setting...
109
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
—Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for differe...
152
click to vote
DAWAK
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...