Sciweavers

2383 search results - page 69 / 477
» Finding Representative Set from Massive Data
Sort
View
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 3 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
ISMB
1997
14 years 11 months ago
Hierarchical Protein Structure Superposition Using Both Secondary Structure and Atomic Representations
The structural comparison of proteins has become increasingly important as a means to identify protein motifs and fold families. In this paper we present a new algorithm for the c...
Amit Pal Singh, Douglas L. Brutlag
AEPIA
2002
159views more  AEPIA 2002»
14 years 9 months ago
Analysing Rough Sets weighting methods for Case-Based Reasoning Systems
Case-Based Reasoning systems retrieve cases using a similarity function based on the K-NN or some derivatives. These functions are sensitive to irrelevant, interacting or noisy fe...
Maria Salamó, Elisabet Golobardes
ISWC
2006
IEEE
15 years 4 months ago
Discovering Characteristic Actions from On-Body Sensor Data
We present an approach to activity discovery, the unsupervised identification and modeling of human actions embedded in a larger sensor stream. Activity discovery can be seen as ...
David Minnen, Thad Starner, Irfan A. Essa, Charles...
WWW
2009
ACM
15 years 2 months ago
Extracting data records from the web using tag path clustering
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
Gengxin Miao, Jun'ichi Tatemura, Wang-Pin Hsiung, ...