Sciweavers

276 search results - page 53 / 56
» Constraint Propagation as a Proof System
Sort
View
ESOP
2009
Springer
14 years 2 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
SIGMOD
2010
ACM
211views Database» more  SIGMOD 2010»
14 years 13 days ago
ERACER: a database approach for statistical inference and data cleaning
Real-world databases often contain syntactic and semantic errors, in spite of integrity constraints and other safety measures incorporated into modern DBMSs. We present ERACER, an...
Chris Mayfield, Jennifer Neville, Sunil Prabhakar
AAAI
2004
13 years 9 months ago
Interactive Information Extraction with Constrained Conditional Random Fields
Information Extraction methods can be used to automatically "fill-in" database forms from unstructured data such as Web documents or email. State-of-the-art methods have...
Trausti T. Kristjansson, Aron Culotta, Paul A. Vio...
FOCS
2006
IEEE
14 years 1 months ago
Strategic Network Formation through Peering and Service Agreements
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. W...
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...