Sciweavers

5326 search results - page 762 / 1066
» On what we can ensure
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
DM
2008
96views more  DM 2008»
15 years 6 months ago
Generating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
Endre Boros, Konrad Borys, Vladimir Gurvich, G&aac...
CCR
2006
115views more  CCR 2006»
15 years 6 months ago
Network coding: an instant primer
Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are...
Christina Fragouli, Jean-Yves Le Boudec, Jörg...
COGSCI
2006
84views more  COGSCI 2006»
15 years 6 months ago
Culture and Change Blindness
Research on perception and cognition suggests that whereas East Asians view the world holistically, attending to the entire field and relations among objects, Westerners view the ...
Takahiko Masuda, Richard E. Nisbett
ORGSCI
2008
78views more  ORGSCI 2008»
15 years 6 months ago
The Penguin Has Entered the Building: The Commercialization of Open Source Software Products
Previous literature on open source software (OSS) mostly analyzes organizational issues within communities of developers and users. This paper focuses on profit-oriented organizat...
Andrea Fosfuri, Marco S. Giarratana, Alessandra Lu...