486 search results - page 27 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
127
click to vote
ICWS
2010
IEEE
15 years 3 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
129
click to vote
PVLDB
2010
15 years 25 days ago
2010
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
133
click to vote
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
110
click to vote
ORL
1998
15 years 2 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
228
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...