1671 search results - page 254 / 335 » On the Covering Steiner Problem |
146
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
153
Voted
HPCA
2006
IEEE
16 years 6 months ago
2006
IEEE
Transactional memory (TM) provides an easy-to-use and high-performance parallel programming model for the upcoming chip-multiprocessor systems. Several researchers have proposed a...
175
Voted
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
164
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
164
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...