1449 search results - page 278 / 290 » Self-Randomized Exponentiation Algorithms |
KDD
2009
ACM
15 years 9 months ago
2009
ACM
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
128
click to vote
AICCSA
2007
IEEE
15 years 8 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
109
Voted
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
103
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. An algorithm to detect invisible relevant persons in a homogeneous social network is studied with computer simulation. The network is effective as a model for contempora...
107
Voted
IPSN
2007
Springer
15 years 8 months ago
2007
Springer
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...