3993 search results - page 444 / 799 » Matchmaking for Structured Objects |
120
click to vote
C3S2E
2008
ACM
15 years 6 months ago
2008
ACM
We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships...
163
click to vote
EUROPAR
2008
Springer
15 years 6 months ago
2008
Springer
Developing a distributed application for mobile resource constrained devices is a difficult and error-prone task that requires awareness of several system-level details (e.g., faul...
140
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
145
click to vote
NIPS
2007
15 years 6 months ago
2007
In recent years, the language model Latent Dirichlet Allocation (LDA), which clusters co-occurring words into topics, has been widely applied in the computer vision field. Howeve...
138
click to vote
PDPTA
2007
15 years 6 months ago
2007
Abstract Super Flexible Messaging (SFM) provides a powerful and elegant message passing abstraction for transferring arbitrary data between remote processes. SFM achieves the simpl...