1201 search results - page 87 / 241 » Linear Probing and Graphs |
102
click to vote
COMBINATORICS
2004
15 years 1 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
100
click to vote
ICDE
2010
IEEE
16 years 27 days ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
112
click to vote
STOC
1998
ACM
15 years 5 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
109
click to vote
STRINGOLOGY
2008
15 years 2 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
100
click to vote
ESA
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...