4542 search results - page 275 / 909 » Design patterns for data structures |
187
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
165
click to vote
JSS
2007
15 years 6 months ago
2007
Designing large software systems out of reusable components has become increasingly popular. Although liberal composition of reusable components saves time and expense, many exper...
160
click to vote
WEBDB
2009
Springer
16 years 1 months ago
2009
Springer
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
261
click to vote
ICDE
1998
IEEE
16 years 7 months ago
1998
IEEE
Semistructured data may be irregular and incomplete and does not necessarily conform to a fixed schema. As with structured data, it is often desirable to maintain a history of cha...
193
click to vote
DGO
2003
15 years 7 months ago
2003
This paper examines digital government projects at the group level. I argue that knowledge transfer plays a crucial role in the conception and implementation of digital government...