Sciweavers

29 search results - page 4 / 6
» A sorting network in bounded arithmetic
Sort
View
POPL
2010
ACM
14 years 4 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
COMPUTING
2006
112views more  COMPUTING 2006»
13 years 7 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts
MDM
2004
Springer
130views Communications» more  MDM 2004»
14 years 8 days ago
Opportunistic Resource Exchange in Inter-Vehicle Ad-Hoc Networks
In this paper we examine resource discovery in inter-vehicle ad-hoc networks in an urban area, where moving vehicles communicate with each other via short-range wireless transmiss...
Bo Xu, Aris M. Ouksel, Ouri Wolfson
SPAA
2005
ACM
14 years 14 days ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
MST
2002
169views more  MST 2002»
13 years 6 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...