820 search results - page 132 / 164 » Finding low-utility data structures |
ADC
2008
Springer
13 years 10 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
EWCBR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper presents a case-based approach to decision support for diabetes management in patients with Type 1 diabetes on insulin pump therapy. To avoid serious disease c...
CSC
2008
13 years 10 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
ICWS
2007
IEEE
13 years 10 months ago
2007
IEEE
Web services are designed to standardize interactions between heterogeneous applications using Internet technologies. Within the framework of Internet search technologies, Web ser...
NIPS
2008
13 years 10 months ago
2008
The coding of information by neural populations depends critically on the statistical dependencies between neuronal responses. However, there is no simple model that can simultane...