Sciweavers

903 search results - page 8 / 181
» Non-well-founded trees in categories
Sort
View
WWW
2007
ACM
16 years 11 days ago
Integrating web directories by learning their structures
Documents in the Web are often organized using category trees by information providers (e.g. CNN, BBC) or search engines (e.g. Google, Yahoo!). Such category trees are commonly kn...
Christopher C. Yang, Jianfeng Lin
TALG
2008
67views more  TALG 2008»
14 years 11 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
CCR
2004
113views more  CCR 2004»
14 years 11 months ago
Implementing aggregation and broadcast over Distributed Hash Tables
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
Ji Li, Karen R. Sollins, Dah-Yoh Lim
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 3 months ago
Characterizing the dynamics of symmetry breaking in genetic programming
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
Jason M. Daida
CVIU
2011
14 years 6 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura