Sciweavers

903 search results - page 165 / 181
» Non-well-founded trees in categories
Sort
View
WWW
2002
ACM
16 years 2 months ago
Accelerated focused crawling through online relevance feedback
The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate an...
Soumen Chakrabarti, Kunal Punera, Mallela Subraman...
128
Voted
WWW
2002
ACM
16 years 2 months ago
A machine learning based approach for table detection on the web
Table is a commonly used presentation scheme, especially for describing relational information. However, table understanding remains an open problem. In this paper, we consider th...
Yalin Wang, Jianying Hu
128
Voted
PPOPP
2009
ACM
16 years 2 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 2 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
16 years 2 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du