Sciweavers

1729 search results - page 104 / 346
» Deterministic Expressions in C
Sort
View
FSS
2007
82views more  FSS 2007»
15 years 6 months ago
An empirical test of some measurement-theoretic axioms for fuzzy sets
In the previous years some authors have been elaborating on the measurementtheoretic foundations of fuzzy set theory. A well-known problem in this approach is the difficult applic...
C. Desimpelaere, Thierry Marchant
IM
2007
15 years 6 months ago
Infinite Limits and Adjacency Properties of a Generalized Copying Model
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
Anthony Bonato, Jeannette C. M. Janssen
JCSS
2007
88views more  JCSS 2007»
15 years 6 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
Denis Xavier Charles
TVCG
2008
121views more  TVCG 2008»
15 years 6 months ago
On the Visualization of Social and other Scale-Free Networks
This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be sh...
Yuntao Jia, Jared Hoberock, Michael Garland, John ...
ALGORITHMICA
2002
159views more  ALGORITHMICA 2002»
15 years 6 months ago
Algorithmic Aspects of Acyclic Edge Colorings
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
Noga Alon, Ayal Zaks