Sciweavers

220 search results - page 44 / 44
» Calling variadic functions from a strongly-typed language
Sort
View
SIGMOD
2006
ACM
145views Database» more  SIGMOD 2006»
14 years 5 months ago
Automatic client-server partitioning of data-driven web applications
Current application development tools provide completely different programming models for the application server (e.g., Java and J2EE) and the client web browser (e.g., JavaScript...
Nicholas Gerner, Fan Yang 0002, Alan J. Demers, Jo...
CL
2008
Springer
13 years 5 months ago
Automatic synthesis and verification of real-time embedded software for mobile and ubiquitous systems
Currently available application frameworks that target the automatic design of real-time embedded software are poor in integrating functional and non-functional requirements for m...
Pao-Ann Hsiung, Shang-Wei Lin
ICALP
2003
Springer
13 years 10 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
WSC
1997
13 years 6 months ago
Integrating Distributed Simulation Objects
Creating comprehensive simulation models can be expensive and time consuming. This paper discusses our efforts to develop a general methodology that will allow users to quickly an...
Joseph A. Heim
IEICET
2006
108views more  IEICET 2006»
13 years 4 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki