Sciweavers

6102 search results - page 296 / 1221
» Generating Optimizing Specializers
Sort
View
134
Voted
EGH
2009
Springer
15 years 1 months ago
Efficient ray traced soft shadows using multi-frusta tracing
Ray tracing has long been considered to be superior to rasterization because its ability to trace arbitrary rays, allowing it to simulate virtually any physical light transport ef...
Carsten Benthin, Ingo Wald
ESWS
2007
Springer
15 years 9 months ago
Scalable Web Service Composition with Partial Matches
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
Adina Sirbu, Jörg Hoffmann
138
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...
136
Voted
MOBIHOC
2001
ACM
16 years 3 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...
125
Voted
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 9 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...