Sciweavers

139 search results - page 20 / 28
» Introduction to Testing Graph Properties
Sort
View
SOCIALCOM
2010
13 years 6 months ago
On the Navigability of Social Tagging Systems
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
Denis Helic, Christoph Trattner, Markus Strohmaier...
CN
2000
109views more  CN 2000»
13 years 8 months ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
JAIR
2006
90views more  JAIR 2006»
13 years 8 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
WDAG
2009
Springer
103views Algorithms» more  WDAG 2009»
14 years 3 months ago
Distributed Discovery of Large Near-Cliques
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
Zvika Brakerski, Boaz Patt-Shamir
JAL
1998
85views more  JAL 1998»
13 years 8 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay