21324 search results - page 595 / 4265 » Making the case for computing |
211
Voted
DAC
2001
ACM
16 years 8 months ago
2001
ACM
In this paper, we present a new technique for the e cient dynamic detection and removal of inactive clauses, i.e. clauses that do not a ect the solutions of interest of a Boolean ...
218
click to vote
PODS
2003
ACM
16 years 7 months ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
193
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
173
Voted
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
We discuss real-world case studies involving the implementation of a web services middleware tier for the IBM Blue Gene/L supercomputer to support financial business applications...
195
click to vote
ESA
2003
Springer
16 years 15 days ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...