20066 search results - page 121 / 4014 » T Spaces |
129
click to vote
COORDINATION
2005
Springer
15 years 10 months ago
2005
Springer
With its decoupling of processes in space and time, the shared data space model has proven to be a well-suited solution for developing distributed component-based systems. However,...
135
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
128
click to vote
SAMOS
2005
Springer
15 years 10 months ago
2005
Springer
Design space exploration plays an essential role in the system-level design of embedded systems. It is imperative therefore to have efficient and effective exploration tools in th...
178
click to vote
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
144
click to vote
MM
2004
ACM
15 years 10 months ago
2004
ACM
We address the problem of unsupervised image auto-annotation with probabilistic latent space models. Unlike most previous works, which build latent space representations assuming ...