4114 search results - page 221 / 823 » Efficient Algorithms for the 2-Center Problems |
168
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
172
click to vote
GIS
2009
ACM
16 years 7 months ago
2009
ACM
We envision participatory texture documentation (PTD) as a process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobile phones parti...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
136
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Effective and efficient mapping algorithms for multisite parallel applications are fundamental to exploit the potentials of grid computing. Since the problem of optimally mapping i...
137
click to vote
PRL
2006
15 years 6 months ago
2006
We present a maximum a posteriori solution to the problem of obtaining a high-resolution image from a set of degraded low-resolution images of the same scene. The proposed algorit...