Sciweavers

1923 search results - page 347 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
87
Voted
PAMI
2007
187views more  PAMI 2007»
14 years 9 months ago
Supervised Learning of Semantic Classes for Image Annotation and Retrieval
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
Gustavo Carneiro, Antoni B. Chan, Pedro J. Moreno,...
SAC
2009
ACM
15 years 4 months ago
Using geo-spatial session tagging for smart multicast session discovery
IP multicast is increasingly seen as efficient mode of live content distribution in the Internet to significantly large subscriber bases. Despite its numerous benefits over IP u...
Piyush Harsh, Richard Newman
PODC
2004
ACM
15 years 3 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
ICDCS
2000
IEEE
15 years 2 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...