Sciweavers

244 search results - page 43 / 49
» Fast Set Intersection in Memory
Sort
View
ICDM
2005
IEEE
163views Data Mining» more  ICDM 2005»
14 years 1 months ago
Efficient Text Classification by Weighted Proximal SVM
In this paper, we present an algorithm that can classify large-scale text data with high classification quality and fast training speed. Our method is based on a novel extension o...
Dong Zhuang, Benyu Zhang, Qiang Yang, Jun Yan, Zhe...
INFOCOM
2003
IEEE
14 years 1 months ago
Load optimal MPLS routing with N+M labels
Abstract— MPLS is becoming an important protocol for intradomain routing. MPLS routers are offered by the major vendors and many ISPs are deploying MPLS in their IP backbones, as...
David Applegate, Mikkel Thorup
ESA
2001
Springer
75views Algorithms» more  ESA 2001»
14 years 6 days ago
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
Alexander Gaysinsky, Alon Itai, Hadas Shachnai
SIGGRAPH
1999
ACM
14 years 20 hour ago
Optimization of Mesh Locality for Transparent Vertex Caching
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
Hugues Hoppe
SC
1994
ACM
13 years 11 months ago
Run-time and compile-time support for adaptive irregular problems
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yua...