Sciweavers

3305 search results - page 198 / 661
» Can we Rely on SQL
Sort
View
RSA
2006
74views more  RSA 2006»
15 years 15 days ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
IFIP
2010
Springer
14 years 7 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
ACL
2007
15 years 2 months ago
Opinion Mining using Econometrics: A Case Study on Reputation Systems
Deriving the polarity and strength of opinions is an important research topic, attracting significant attention over the last few years. In this work, to measure the strength and...
Anindya Ghose, Panagiotis G. Ipeirotis, Arun Sunda...
195
Voted
CP
2009
Springer
16 years 1 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
91
Voted
WEBI
2004
Springer
15 years 6 months ago
An Integrated Approach to Discovery in Complex Information Spaces
As the amount of available data continues to increase, more and more effective means for discovering important patterns and relationships within that data are required. Although t...
Daryl H. Hepting, Cory J. Butz