903 search results - page 63 / 181 » Non-well-founded trees in categories |
190
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
142
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
177
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
142
click to vote
SENSYS
2009
ACM
16 years 29 days ago
2009
ACM
This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistenc...
147
click to vote
SPIRE
2009
Springer
16 years 21 days ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ...