4536 search results - page 623 / 908 » Contention-Sensitive Data Structures and Algorithms |
182
click to vote
ICDT
2007
ACM
16 years 25 days ago
2007
ACM
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
163
click to vote
IFSA
2007
Springer
16 years 25 days ago
2007
Springer
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
173
click to vote
ANSS
2006
IEEE
16 years 23 days ago
2006
IEEE
— Computer simulations of complex systems such as physical aggregation processes or swarming and collective behaviour of life-forms, often require order N-squared computational c...
150
click to vote
SIGIR
2003
ACM
15 years 12 months ago
2003
ACM
This paper investigates the pre-conditions for successful combination of document representations formed from structural markup for the task of known-item search. As this task is ...
185
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...