2830 search results - page 288 / 566 » No Science without Semantics |
153
click to vote
IDEAS
2002
IEEE
15 years 9 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
105
click to vote
CIKM
1999
Springer
15 years 8 months ago
1999
Springer
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
103
click to vote
HPCN
1997
Springer
15 years 8 months ago
1997
Springer
An application-level technique is described for farmer-worker parallel applications which allows a worker to be added or removed from the computing farm at any moment of the run ti...
127
click to vote
ACMICEC
2007
ACM
15 years 8 months ago
2007
ACM
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
144
click to vote
ESA
2000
Springer
15 years 8 months ago
2000
Springer
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...