Sciweavers

556 search results - page 29 / 112
» A Comparative Study of Some Generalized Rough Approximations
Sort
View
KDD
2008
ACM
274views Data Mining» more  KDD 2008»
16 years 2 months ago
Data mining using high performance data clouds: experimental studies using sector and sphere
We describe the design and implementation of a high performance cloud that we have used to archive, analyze and mine large distributed data sets. By a cloud, we mean an infrastruc...
Robert L. Grossman, Yunhong Gu
114
Voted
SIGIR
2008
ACM
15 years 7 days ago
Searching blogs and news: a study on popular queries
Blog/news search engines are very important channels to reach information about the real-time happenings. In this paper, we study the popular queries collected over one year perio...
Aixin Sun, Meishan Hu, Ee-Peng Lim
164
Voted
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 6 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
15 years 7 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
IPPS
1998
IEEE
15 years 6 months ago
Network-Aware Distributed Computing: A Case Study
Abstract. The development of network-aware applications, i.e. applications that dynamically adapt to network conditions, has had some success in the domain of multimedia applicatio...
Hongsuda Tangmunarunkit, Peter Steenkiste