7773 search results - page 168 / 1555 » On generalized Frame-Stewart numbers |
CHI
2010
ACM
15 years 5 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
WWW
2010
ACM
15 years 5 months ago
2010
ACM
In a social news website people share content they found on the web, called news, then vote for those they like the most. Voting for a news is then considered as a recommendation,...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
82
Voted
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
MODELS
2009
Springer
15 years 4 months ago
2009
Springer
This paper summarizes the experience of teaching objectoriented modeling and UML for more than a decade to various audiences (academic or corporate, software developers or not). W...