Sciweavers

4155 search results - page 760 / 831
» Topic-Specific Optimization and Structuring
Sort
View
ICS
2005
Tsinghua U.
15 years 7 months ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...
IUI
2004
ACM
15 years 7 months ago
Robust sketched symbol fragmentation using templates
Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applicatio...
Heloise Hwawen Hse, Michael Shilman, A. Richard Ne...
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 7 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
CIKM
2004
Springer
15 years 7 months ago
Hierarchical document categorization with support vector machines
Automatically categorizing documents into pre-defined topic hierarchies or taxonomies is a crucial step in knowledge and content management. Standard machine learning techniques ...
Lijuan Cai, Thomas Hofmann
PLDI
2003
ACM
15 years 6 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...