1732 search results - page 144 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
159
click to vote
ACE
2004
15 years 8 months ago
2004
This paper introduces PigWorld, a tool for teaching Java to novice programmers, via the objects-early style. Three design guidelines forobject-early assignments are discussed: (1)...
197
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
148
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
168
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
157
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...