1066 search results - page 110 / 214 » Computing Private Set Operations with Linear Complexities |
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
SI3D
2006
ACM
15 years 3 months ago
2006
ACM
We propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches...
107
click to vote
CIE
2009
Springer
15 years 1 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
ICCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The complexity of virtual environments has grown spectacularly over the recent years, mainly thanks to the use of the currently cheap high performance graphics cards. As ...