1208 search results - page 135 / 242 » Uniform eventown problems |
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
158
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
In recent years there has been considerable research on automated selection of physical design in database systems. In current solutions, candidate access paths are heuristically ...
EDBT
2004
ACM
15 years 10 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
ALT
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...