514 search results - page 39 / 103 » Foundations of Aggregation Constraints |
COMPGEOM
1992
ACM
14 years 5 days ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
MOBISYS
2007
ACM
14 years 7 months ago
2007
ACM
We envision a new better-together mobile application paradigm where multiple mobile devices are placed in a close proximity and study a specific together-viewing video application...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...