1458 search results - page 182 / 292 » Practical Preference Relations for Large Data Sets |
171
click to vote
TELECARE
2004
15 years 6 months ago
2004
Nowadays the scientific community is trying to design new techniques in the search for solving security problems in mobile agent technology. There are now some industry initiatives...
201
click to vote
VLDB
1999
ACM
15 years 9 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
143
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
172
click to vote
CLOUD
2010
ACM
15 years 10 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
162
click to vote
ITNG
2010
IEEE
15 years 10 months ago
2010
IEEE
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...