6575 search results - page 811 / 1315 » Specializing visualization algorithms |
167
click to vote
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
15 years 12 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
132
Voted
ICCNMC
2005
Springer
15 years 12 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
173
click to vote
NOSSDAV
2005
Springer
15 years 11 months ago
2005
Springer
We propose an efficient placement algorithm and per-disk prefetching method to effectively support interactive operations in the media server. Our placement policy is incorporate...
190
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a general family of 3D hinged dissections for polypolyhedra, i.e., connected 3D solids formed by joining several rigid copies of the same polyhedron along iden...
163
click to vote
CASES
2004
ACM
15 years 11 months ago
2004
ACM
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy...