Sciweavers

243 search results - page 42 / 49
» Programmers' views of SoCs
Sort
View
97
Voted
SIGSOFT
2007
ACM
16 years 12 days ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
WWW
2008
ACM
16 years 10 days ago
Wishful search: interactive composition of data mashups
With the emergence of Yahoo Pipes and several similar services, data mashup tools have started to gain interest of business users. Making these tools simple and accessible to user...
Anton Riabov, Eric Bouillet, Mark Feblowitz, Zhen ...
WWW
2004
ACM
16 years 10 days ago
How to make a semantic web browser
Two important architectural choices underlie the success of the Web: numerous, independently operated servers speak a common protocol, and a single type of client--the Web browser...
D. A. Quan, R. Karger
WWW
2004
ACM
16 years 10 days ago
Delivering web service coordination capability to users
As web service technology matures there is growing interest in exploiting workflow techniques to coordinate web services. Bioinformaticians are a user community who combine web re...
Thomas M. Oinn, Matthew Addis, Justin Ferris, Darr...
POPL
2009
ACM
16 years 9 days ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...