Sciweavers

2297 search results - page 245 / 460
» An Algorithm for Computing the Integral Closure
Sort
View
WWW
2009
ACM
16 years 5 months ago
Link based small sample learning for web spam detection
Robust statistical learning based web spam detection system often requires large amounts of labeled training data. However, labeled samples are more difficult, expensive and time ...
Guanggang Geng, Qiudan Li, Xinchang Zhang
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
16 years 1 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
FSTTCS
2009
Springer
15 years 11 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
FPGA
2003
ACM
123views FPGA» more  FPGA 2003»
15 years 9 months ago
Wire type assignment for FPGA routing
The routing channels of an FPGA consist of wire segments of various types providing the tradeoff between performance and routability. In the routing architectures of recently dev...
Seokjin Lee, Hua Xiang, D. F. Wong, Richard Y. Sun
VLDB
1998
ACM
149views Database» more  VLDB 1998»
15 years 8 months ago
Incremental Maintenance for Materialized Views over Semistructured Data
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
Serge Abiteboul, Jason McHugh, Michael Rys, Vasili...