461 search results - page 91 / 93 » Practical polynomial factoring in polynomial time |
KDD
2010
ACM
13 years 10 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
DEBS
2008
ACM
13 years 8 months ago
2008
ACM
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
IJISEC
2007
13 years 7 months ago
2007
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
SIAMCOMP
2002
13 years 7 months ago
2002
abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
ML
2007
ACM
13 years 6 months ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...