Sciweavers

1984 search results - page 379 / 397
» The colourful feasibility problem
Sort
View
EUROCRYPT
2010
Springer
14 years 2 months ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
ICS
2010
Tsinghua U.
14 years 2 months ago
Streamlining GPU applications on the fly: thread divergence elimination through runtime thread-data remapping
Because of their tremendous computing power and remarkable cost efficiency, GPUs (graphic processing unit) have quickly emerged as an influential computing platform for a broad ...
Eddy Z. Zhang, Yunlian Jiang, Ziyu Guo, Xipeng She...
LPAR
2001
Springer
14 years 2 months ago
Local Conditional High-Level Robot Programs
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
Sebastian Sardiña
SEMWEB
2001
Springer
14 years 2 months ago
OntoMap - the Guide to the Upper-Level
Abstract. The upper-level ontologies are theories that capture the most common concepts, which are relevant for many of the tasks involving knowledge extraction, representation, an...
Atanas K. Kirakov, Marin Dimitrov
ICNP
1999
IEEE
14 years 2 months ago
Effect of Unreliable Nodes on QoS Routing
A number of QoS routing algorithms have been proposed to address the dual objective of selecting feasible paths through the network with enough resources to satisfy a connections&...
Swapna S. Gokhale, Satish K. Tripathi