Sciweavers

2079 search results - page 171 / 416
» Research Problems in Data Warehousing
Sort
View
95
Voted
FCT
1991
Springer
15 years 1 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
82
Voted
DBSEC
2008
137views Database» more  DBSEC 2008»
14 years 11 months ago
Towards Automation of Testing High-Level Security Properties
Abstract. Many security problems only become apparent after software is deployed, and in many cases a failure has occurred prior to the awareness of the problem. Although many woul...
Aiman Hanna, Hai Zhou Ling, Jason Furlong, Mourad ...
87
Voted
ECSCW
2007
14 years 11 months ago
Tag-Based Metonymic Search in an Activity-Centric Aggregation Service
Knowledge workers often need to find, organize, and work with heterogeneous resources from diverse services, information stores, and repositories. This paper analyzes two problems ...
Michael J. Muller, Werner Geyer, Beth Brownholtz, ...
95
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
84
Voted
ISCI
2008
117views more  ISCI 2008»
14 years 10 months ago
Search based software testing of object-oriented containers
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
Andrea Arcuri, Xin Yao