1308 search results - page 86 / 262 » Let's Have a Conversation |
CCS
2006
ACM
15 years 3 months ago
2006
ACM
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
CICLING
2008
Springer
15 years 1 months ago
2008
Springer
Short texts clustering is one of the most difficult tasks in natural language processing due to the low frequencies of the document terms. We are interested in analysing these kind...
BCSHCI
2008
15 years 20 days ago
2008
CiteULike is a collaborative tagging web site which lets users enter academic references into a database and describe these references using tags (categorizations of their own cho...
CCCG
2010
15 years 20 days ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...