3820 search results - page 247 / 764 » Bounded Model Debugging |
137
Voted
WOTUG
2008
15 years 5 months ago
2008
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
137
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
138
Voted
CSL
2009
Springer
15 years 7 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
135
Voted
ECCC
2008
15 years 3 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
113
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...