Sciweavers

2850 search results - page 311 / 570
» On Timed Models and Full Abstraction
Sort
View
ALT
2004
Springer
16 years 3 months ago
Learning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
Sanjay Jain, Efim B. Kinber
189
Voted
SIGMETRICS
2010
ACM
208views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
Dynamics in congestion games
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
Devavrat Shah, Jinwoo Shin
MOBISYS
2010
ACM
15 years 9 months ago
PRISM: platform for remote sensing using smartphones
To realize the potential of opportunistic and participatory sensing using mobile smartphones, a key challenge is ensuring the ease of developing and deploying such applications, w...
Tathagata Das, Prashanth Mohan, Venkata N. Padmana...
CODASPY
2012
14 years 2 months ago
Identifying native applications with high assurance
Main stream operating system kernels lack a strong and reliable mechanism for identifying the running processes and binding them to the corresponding executable applications. In t...
Hussain M. J. Almohri, Danfeng (Daphne) Yao, Denni...
ICALP
2009
Springer
16 years 7 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro