Sciweavers

2060 search results - page 202 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
PODC
2009
ACM
15 years 10 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
ICIP
1998
IEEE
15 years 2 months ago
Image Warping using Adaptive Partial Matching
The block-matching motion estimation algorithm using a translational motion model cannot provide acceptable image quality in low bit-rate coding. To improve coding performance, we ...
Dong-Keun Lim, Yo-Sung Ho
97
Voted
SAC
2009
ACM
15 years 5 months ago
Celling SHIM: compiling deterministic concurrency to a heterogeneous multicore
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...
Nalini Vasudevan, Stephen A. Edwards
AI
2005
Springer
14 years 10 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val