Sciweavers

741 search results - page 118 / 149
» Problem Programmers
Sort
View
150
Voted
EGH
2009
Springer
15 years 1 months ago
Parallel view-dependent tessellation of Catmull-Clark subdivision surfaces
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
Anjul Patney, Mohamed S. Ebeida, John D. Owens
134
Voted
ENTCS
2010
96views more  ENTCS 2010»
15 years 1 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
141
Voted
COMPSAC
2011
IEEE
14 years 3 months ago
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
Axel Schröpfer, Florian Kerschbaum, Guenter M...
POPL
2009
ACM
16 years 4 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
129
Voted
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 9 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...