Sciweavers

879 search results - page 96 / 176
» Designing Closer to the Edge
Sort
View
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 7 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
TWC
2010
13 years 3 months ago
Enhancing cell-edge performance: a downlink dynamic interference avoidance scheme with inter-cell coordination
Interference management has been a key concept for designing future high data-rate wireless systems that are required to employ dense reuse of spectrum. Static or semistatic interf...
Mahmudur Rahman, Halim Yanikomeroglu
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
12 years 11 months ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 11 months ago
Intrusion as (anti)social communication: characterization and detection
A reasonable definition of intrusion is: entering a community to which one does not belong. This suggests that in a network, intrusion attempts may be detected by looking for com...
Qi Ding, Natallia Katenka, Paul Barford, Eric D. K...
DATE
2002
IEEE
83views Hardware» more  DATE 2002»
14 years 1 months ago
Reconfigurable SoC - What Will it Look Like?
The argument against ASIC SoCs is that they have always taken too long and cost too much to design. As new process technologies come on line, the issue of inflexible, unyielding d...
J. Bryan Lewis, Ivo Bolsens, Rudy Lauwereins, Chri...