Sciweavers

1985 search results - page 303 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
ASPLOS
1992
ACM
15 years 7 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
ATAL
2006
Springer
15 years 7 months ago
Multi-agent based peer-to-peer information retrieval systems with concurrent search sessions
In cooperative peer-to-peer information retrieval systems, each node can be considered an intelligent agent and these agents work collectively to provide an information retrieval ...
Haizheng Zhang, Victor R. Lesser
CIKM
2006
Springer
15 years 7 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 7 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
NIL
1991
15 years 6 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass