Sciweavers

1763 search results - page 306 / 353
» A Formalization of Polytime Functions
Sort
View
PVLDB
2008
132views more  PVLDB 2008»
14 years 9 months ago
Access control over uncertain data
Access control is the problem of regulating access to secret information based on certain context information. In traditional applications, context information is known exactly, p...
Vibhor Rastogi, Dan Suciu, Evan Welbourne
FSS
2010
107views more  FSS 2010»
14 years 8 months ago
Cut approach to islands in rectangular fuzzy relations
The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation i...
Eszter K. Horváth, Branimir Seselja, Andrej...
INFOCOM
2010
IEEE
14 years 8 months ago
On Scheduling for Minimizing End-to-End Buffer Usage over Multihop Wireless Networks
—While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) ...
V. J. Venkataramanan, Xiaojun Lin, Lei Ying, Sanja...
JOT
2010
144views more  JOT 2010»
14 years 8 months ago
REquirements, Aspects and Software Quality: the REASQ model
Object-oriented analysis and design have been more concerned with system functionality, neglecting non-functional aspects; the result is code which is tangled and difficult to main...
Isi Castillo, Francisca Losavio, Alfredo Matteo, J...
LICS
2010
IEEE
14 years 8 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...