7421 search results - page 1251 / 1485 » In search of dependable design |
161
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
201
click to vote
ACMICEC
2007
ACM
15 years 10 months ago
2007
ACM
Needs-based analysis lies at the intersection of product marketing and new product development. It is the study of why consumers purchase and what they do with those purchases. In...
179
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
174
Voted
DSN
2007
IEEE
15 years 10 months ago
2007
IEEE
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
172
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...