357 search results - page 53 / 72 » An Algebraic Approach to the Complexity of Generalized Conju... |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
SIGMOD
2010
ACM
14 years 23 days ago
2010
ACM
Discrimination discovery in databases consists in finding unfair practices against minorities which are hidden in a dataset of historical decisions. The DCUBE system implements t...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
PLDI
2011
ACM
12 years 10 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...