Sciweavers

531 search results - page 95 / 107
» Formal Methods for Networks on Chips
Sort
View
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 1 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
KI
2005
Springer
14 years 29 days ago
Dependency Calculus: Reasoning in a General Point Relation Algebra
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
Marco Ragni, Alexander Scivos
ICML
2009
IEEE
14 years 8 months ago
Curriculum learning
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...
Jérôme Louradour, Jason Weston, Ronan...
WWW
2008
ACM
14 years 8 months ago
Measuring extremal dependencies in web graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
Yana Volkovich, Nelly Litvak, Bert Zwart