4131 search results - page 44 / 827 » Compactness in Topology and Computation |
111
click to vote
TPDS
2002
15 years 1 months ago
2002
Multiprocessor architectures demand efficient interprocessor communication to maximize system utilization and performance. To meet future demands, these interconnects must communic...
110
click to vote
GRAPHITE
2007
ACM
15 years 5 months ago
2007
ACM
We present a data-driven technique for generating the precomputed radiance transfer vectors of an animated character as a function of its joint angles. We learn a linear model for...
123
click to vote
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
143
click to vote
ANCS
2009
ACM
14 years 11 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
CHI
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we compare the impact of two different privacy policy representations – AudienceView and Expandable Grids – on users modifying privacy policies for a social net...