Sciweavers

3378 search results - page 488 / 676
» A universe of binding and computation
Sort
View
ICALP
2009
Springer
15 years 10 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
PERCOM
2005
ACM
15 years 9 months ago
Secure context-sensitive authorization
There is a recent trend toward rule-based authorization systems to achieve flexible security policies. Also, new sensing technologies in pervasive computing make it possible to de...
Kazuhiro Minami, David Kotz
62
Voted
MOBISYS
2007
ACM
15 years 9 months ago
Simplifying cyber foraging for mobile devices
Cyber foraging is the transient and opportunistic use of compute servers by mobile devices. The short market life of such devices makes rapid modification of applications for remo...
Rajesh Krishna Balan, Darren Gergle, Mahadev Satya...
DCC
2008
IEEE
15 years 9 months ago
On vector space partitions and uniformly resolvable designs
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...
Andrew Blinco, Saad El-Zanati, G. F. Seelinger, P....
80
Voted
CVPR
2010
IEEE
15 years 6 months ago
Reading Between The Lines: Object Localization Using Implicit Cues from Image Tags
Current uses of tagged images typically exploit only the most explicit information: the link between the nouns named and the objects present somewhere in the image. We propose to ...
Sung Ju Hwang, University of Texas, Kristen Grauma...