405 search results - page 35 / 81 » Using critical sets to solve the maximum independent set pro... |
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
CCIA
2005
Springer
13 years 9 months ago
2005
Springer
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The pr...
SIAMCOMP
2000
13 years 7 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
AIME
2001
Springer
14 years 4 days ago
2001
Springer
Medical protocols are widely recognised to provide clinicians with high-quality and up-to-date recommendations. A critical condition for this is of course that the protocols themse...
SIGMETRICS
2010
ACM
14 years 13 days ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...