Sciweavers

2376 search results - page 157 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
COLT
2010
Springer
13 years 6 months ago
Characterization of Linkage-based Clustering
Clustering is a central unsupervised learning task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, unlike classification ta...
Margareta Ackerman, Shai Ben-David, David Loker
IJWET
2008
81views more  IJWET 2008»
13 years 8 months ago
XFIS: an XML filtering system based on string representation and matching
: Information-filtering systems constitute a critical component of modern information-seeking applications. As the number of users grows and the amount of information available bec...
Panagiotis Antonellis, Christos Makris
IJAR
2006
89views more  IJAR 2006»
13 years 8 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
NSDI
2004
13 years 9 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
TMC
2008
91views more  TMC 2008»
13 years 7 months ago
Efficient and Resilient Backbones for Multihop Wireless Networks
We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...
Seungjoon Lee, Bobby Bhattacharjee, Aravind Sriniv...