Sciweavers

2127 search results - page 314 / 426
» Computing large matchings fast
Sort
View
PERCOM
2011
ACM
14 years 7 months ago
P3-coupon: A probabilistic system for Prompt and Privacy-preserving electronic coupon distribution
—In this paper, we propose P3 -coupon, a Prompt and Privacy-preserving electronic coupon distribution system based on a Probabilistic one-ownership forwarding algorithm. In this ...
Boying Zhang, Jin Teng, Xiaole Bai, Zhimin Yang, D...
SIAMNUM
2011
102views more  SIAMNUM 2011»
14 years 6 months ago
Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
Nicola Guglielmi, Christian Lubich
HPCC
2011
Springer
14 years 3 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
CVPR
2012
IEEE
13 years 6 months ago
Beyond spatial pyramids: Receptive field learning for pooled image features
In this paper we examine the effect of receptive field designs on classification accuracy in the commonly adopted pipeline of image classification. While existing algorithms us...
Yangqing Jia, Chang Huang, Trevor Darrell

Publication
196views
17 years 2 months ago
Improving the Performance of TCP over the ATM-UBR service
In this paper we study the design issues in improving TCP performance over the ATM UBR service. ATM-UBR switches respond to congestion by dropping cells when their buffers become f...
Rohit Goyal, Raj Jain, Shiv Kalyanaraman, Sonia Fa...