Sciweavers

903 search results - page 37 / 181
» Non-well-founded trees in categories
Sort
View
WWW
2005
ACM
16 years 14 days ago
Focused crawling by exploiting anchor text using decision tree
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
SIGGRAPH
2000
ACM
15 years 4 months ago
Computer-generated pen-and-ink illustration of trees
We present a method for automatically rendering pen-and-ink illustrations of trees. A given 3-d tree model is illustrated by the tree and a visual representation of the foliage us...
Oliver Deussen, Thomas Strothotte
PODS
2008
ACM
211views Database» more  PODS 2008»
15 years 12 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
LATA
2009
Springer
15 years 6 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
15 years 3 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad