608 search results - page 77 / 122 » Random Systems with Complete Connections |
152
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
BMCBI
2006
14 years 9 months ago
2006
Background: A wide range of research areas in bioinformatics, molecular biology and medicinal chemistry require precise chemical structure information about molecules and reaction...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we study the media workload collected from a large number of commercial Web sites hosted by a major ISP and that collected from a large group of home users connecte...
SIGGRAPH
1994
ACM
15 years 1 months ago
1994
ACM
The use of double-buffered displays, in which the previous image is displayed until the next image is complete, can impair the interactivity of systems that require tight coupling...