Sciweavers

2924 search results - page 464 / 585
» Lower Bounds in Distributed Computing
Sort
View
TCS
2008
15 years 4 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
134
Voted
RT
2004
Springer
15 years 10 months ago
Real-time appearance preserving out-of-core rendering with shadows
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...
Michael Guthe, Pavel Borodin, Ákos Bal&aacu...
FCT
1997
Springer
15 years 8 months ago
Trade-Off Results for Connection Management
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
Marios Mavronicolas, Nikos Papadakis
DAC
2010
ACM
15 years 8 months ago
LUT-based FPGA technology mapping for reliability
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
Jason Cong, Kirill Minkovich
AAAI
2010
15 years 6 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...