522 search results - page 67 / 105 » On the Hardness of the Noncommutative Determinant |
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descript...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...