35419 search results - page 6876 / 7084 » How are we doing |
150
click to vote
PEPM
2009
ACM
16 years 1 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
136
Voted
CSCW
2010
ACM
16 years 1 months ago
2010
ACM
It would be useful if software engineers/instructors could be aware that remote team members/students are having difficulty with their programming tasks. We have developed an appr...
137
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 17 days ago
2010
Eurographics
When simulating fluids, tetrahedral methods provide flexibility and ease of adaptivity that Cartesian grids find difficult to match. However, this approach has so far been lim...
129
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
As sophisticated enterprise applications move to the Web, some advanced user experiences become difficult to migrate due to prohibitively high computation, memory, and bandwidth r...
137
click to vote
TCC
2010
Springer
15 years 11 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...