Sciweavers

3702 search results - page 491 / 741
» All Pairings Are in a Group
Sort
View
MICRO
2003
IEEE
108views Hardware» more  MICRO 2003»
15 years 12 months ago
Reducing Design Complexity of the Load/Store Queue
With faster CPU clocks and wider pipelines, all relevant microarchitecture components should scale accordingly. There have been many proposals for scaling the issue queue, registe...
Il Park, Chong-liang Ooi, T. N. Vijaykumar
FOCS
2002
IEEE
15 years 11 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
ICALP
2010
Springer
15 years 11 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
VLDB
2001
ACM
148views Database» more  VLDB 2001»
15 years 11 months ago
Indexing and Querying XML Data for Regular Path Expressions
With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languag...
Quanzhong Li, Bongki Moon
181
Voted
KDD
1999
ACM
220views Data Mining» more  KDD 1999»
15 years 11 months ago
Efficient Mining of Emerging Patterns: Discovering Trends and Differences
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
Guozhu Dong, Jinyan Li