Sciweavers

2436 search results - page 74 / 488
» Comonadic Notions of Computation
Sort
View
133
Voted
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 4 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
AB
2007
Springer
15 years 10 months ago
Cascaded Games
We introduce a novel model construction, cascaded games, that is intended to allow us to study the notion of steady states algebraically and structurally. The model construction is...
Jittisak Senachak, Mun'delanji Vestergaard, Ren&ea...
SAGA
2007
Springer
15 years 9 months ago
Randomized Algorithms and Probabilistic Analysis in Wireless Networking
Abstract. Devices connected wirelessly, in various forms including computers, hand-held devices, ad hoc networks, and embedded systems, are expected to become ubiquitous all around...
Aravind Srinivasan
GRC
2005
IEEE
15 years 9 months ago
Temporal granular logic for temporal data mining
— In this article, a formalism for a specific temporal data mining task (the discovery of rules, inferred from databases of events having a temporal dimension), is defined. The...
Paul Cotofrei, Kilian Stoffel
104
Voted
ECAI
2004
Springer
15 years 9 months ago
A General Recursive Schema for Argumentation Semantics
Abstract. In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics...
Pietro Baroni, Massimiliano Giacomin