Sciweavers

9359 search results - page 453 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
ICCAD
1996
IEEE
111views Hardware» more  ICCAD 1996»
15 years 11 months ago
Multi-level spectral hypergraph partitioning with arbitrary vertex sizes
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...
Jason Y. Zien, Martine D. F. Schlag, Pak K. Chan
AOSD
2007
ACM
15 years 10 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
COMPGEOM
2007
ACM
15 years 10 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
CIKM
2009
Springer
15 years 10 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 10 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders