5606 search results - page 459 / 1122 » Randomization Techniques for Graphs. |
199
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
190
click to vote
JSAC
2011
15 years 1 months ago
2011
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
200
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
195
Voted
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
203
click to vote
LCPC
1994
Springer
15 years 11 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...