2168 search results - page 348 / 434 » Randomized Algorithms and Complexity Theory |
136
click to vote
ITCC
2005
IEEE
15 years 8 months ago
2005
IEEE
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
140
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
116
click to vote
SC
2003
ACM
15 years 8 months ago
2003
ACM
We report on a model of the distribution of job submission interarrival times in supercomputers. Interarrival times are modeled as a consequence of a complicated set of decisions ...
142
click to vote
SMA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
138
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...