Sciweavers

1813 search results - page 260 / 363
» Instance Pruning Techniques
Sort
View
WWW
2004
ACM
16 years 7 months ago
OntoMiner: bootstrapping ontologies from overlapping domain specific web sites
In this paper, we present automated techniques for bootstrapping and populating specialized domain ontologies by organizing and mining a set of relevant overlapping Web sites prov...
Hasan Davulcu, Srinivas Vadrevu, Saravanakumar Nag...
ASPLOS
2009
ACM
16 years 7 months ago
Maximum benefit from a minimal HTM
A minimal, bounded hardware transactional memory implementation significantly improves synchronization performance when used in an operating system kernel. We add HTM to Linux 2.4...
Owen S. Hofmann, Christopher J. Rossbach, Emmett W...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
KDD
2001
ACM
166views Data Mining» more  KDD 2001»
16 years 6 months ago
Generalized clustering, supervised learning, and data assignment
Clustering algorithms have become increasingly important in handling and analyzing data. Considerable work has been done in devising effective but increasingly specific clustering...
Annaka Kalton, Pat Langley, Kiri Wagstaff, Jungsoo...
POPL
2007
ACM
16 years 6 months ago
Lock allocation
We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assig...
Michael Emmi, Jeffrey S. Fischer, Ranjit Jhala, Ru...