Sciweavers

556 search results - page 26 / 112
» A Comparative Study of Some Generalized Rough Approximations
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 1 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
ECAI
2010
Springer
15 years 2 months ago
The Epistemic View of Belief Merging: Can We Track the Truth?
Abstract. Belief merging is often described as the process of defining a base which best represents the beliefs of a group of agents (a profile of belief bases). The resulting base...
Patricia Everaere, Sébastien Konieczny, Pie...
EXPDB
2006
ACM
15 years 7 months ago
Performance Study of Rollout for Multi Dimensional Clustered Tables in DB2
In data warehousing applications, the ability to efficiently delete large chunks of data from a table is very important. This feature is also known as Rollout. Rollout is generall...
Bishwaranjan Bhattacharjee
AIRS
2004
Springer
15 years 7 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
CIARP
2003
Springer
15 years 5 months ago
Uniclass and Multiclass Connectionist Classification of Dialogue Acts
Classification problems are traditionally focused on uniclass samples, that is, each sample of the training and test sets has one unique label, which is the target of the classific...
María José Castro Bleda, David Vilar...