Sciweavers

4913 search results - page 43 / 983
» Results and Perspectives of the G
Sort
View
JUCS
2008
115views more  JUCS 2008»
13 years 9 months ago
Drives and Barriers for Development of Broadband Access - CE Perspective
: Development of e-services in the CE (Central European) countries depends on a number of factors which can result in overcoming or extending digital divide between the "new&q...
Zbigniew Hulicki
DM
2008
69views more  DM 2008»
13 years 9 months ago
Connectedness of the graph of vertex-colourings
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
COMBINATORICS
2007
88views more  COMBINATORICS 2007»
13 years 9 months ago
Maximum Matchings in Regular Graphs of High Girth
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
Abraham D. Flaxman, Shlomo Hoory
CIKM
2009
Springer
14 years 1 months ago
Improvements that don't add up: ad-hoc retrieval results since 1998
The existence and use of standard test collections in information retrieval experimentation allows results to be compared between research groups and over time. Such comparisons, ...
Timothy G. Armstrong, Alistair Moffat, William Web...
HICSS
2010
IEEE
200views Biometrics» more  HICSS 2010»
13 years 11 months ago
Instability of Relevance-Ranked Results Using Latent Semantic Indexing for Web Search
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...
Houssain Kettani, Gregory B. Newby