Sciweavers

16430 search results - page 846 / 3286
» On Computable Tree Functions
Sort
View
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
16 years 12 days ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 7 months ago
On Unconditionally Secure Computation with Vanishing Communication Cost
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
Ye Wang, Shantanu Rane, Wei Sun, Prakash Ishwar
BMCBI
2010
121views more  BMCBI 2010»
15 years 5 months ago
Computing DNA duplex instability profiles efficiently with a two-state model: trends of promoters and binding sites
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
Miriam R. Kantorovitz, Zoi Rapti, Vladimir Gelev, ...
FEDCSIS
2011
90views more  FEDCSIS 2011»
14 years 7 months ago
Services Composition Model for Home-Automation peer-to-peer Pervasive Computing
—Collaborative mechanisms between services are a crucial aspect in the recent development of pervasive computing systems based on the paradigm of service-oriented architecture. C...
Juan A. Holgado-Terriza, Sandra Rodríguez-V...
FCCM
2008
IEEE
212views VLSI» more  FCCM 2008»
16 years 2 months ago
Map-reduce as a Programming Model for Custom Computing Machines
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
Jackson H. C. Yeung, C. C. Tsang, Kuen Hung Tsoi, ...