Sciweavers

1871 search results - page 64 / 375
» The Ephemeral Pairing Problem
Sort
View
IEEEARES
2006
IEEE
15 years 5 months ago
Evaluation of Network Robustness for Given Defense Resource Allocation Strategies
Since the 9/11 terrorist attacks, the effective and efficient protection of critical information infrastructures has become an even more important issue. To enhance network surviv...
Y.-S. Lin, P.-H. Tsang, C.-H. Chen, C.-L. Tseng, Y...
SPIRE
2005
Springer
15 years 4 months ago
Composite Pattern Discovery for PCR Application
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...
Stanislav Angelov, Shunsuke Inenaga
JPDC
2008
100views more  JPDC 2008»
14 years 11 months ago
Data-stream-based global event monitoring using pairwise interactions
The problem of global state observation is fundamental to distributed systems and to the analysis of data streams. Many interactions in distributed systems can be analyzed in term...
Punit Chandra, Ajay D. Kshemkalyani
COLT
2003
Springer
15 years 4 months ago
Learning with Equivalence Constraints and the Relation to Multiclass Learning
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
Aharon Bar-Hillel, Daphna Weinshall
102
Voted
ESA
2008
Springer
81views Algorithms» more  ESA 2008»
15 years 28 days ago
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
Pankaj K. Agarwal, Jeff M. Phillips