Sciweavers

1154 search results - page 42 / 231
» Mathematizing C concurrency
Sort
View
IPL
2010
160views more  IPL 2010»
13 years 7 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus
DCG
2010
67views more  DCG 2010»
13 years 9 months ago
Conformal Mapping in Linear Time
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
Christopher J. Bishop
CONCURRENCY
1998
83views more  CONCURRENCY 1998»
13 years 8 months ago
Supporting universal personal computing on the Internet with Java and CORBA
Universal Personal Computing (UPC) supports nomadic computing on the Internet by allowing mobile users to access their personalized computing resources anywhere on the Internet us...
Jinsong Zhu, Maria Törö, Victor C. M. Le...
SIGCOMM
2010
ACM
13 years 9 months ago
Contrabass: concurrent transmissions without coordination
A PHY and MAC protocol for MIMO concurrent transmissions, called Contrabass, is presented. Concurrent transmissions, also referred to as multi-user MIMO, are simultaneous transmis...
Sungro Yoon
ICALP
2010
Springer
14 years 1 months ago
Concurrent Knowledge Extraction in the Public-Key Model
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
Andrew C. Yao, Moti Yung, Yunlei Zhao