Sciweavers

447 search results - page 26 / 90
» Decision trees with minimal costs
Sort
View
TELSYS
2002
128views more  TELSYS 2002»
13 years 8 months ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo
ATAL
2008
Springer
13 years 10 months ago
Learning task-specific trust decisions
We study the problem of agents locating other agents that are both capable and willing to help complete assigned tasks. An agent incurs a fixed cost for each help request it sends...
Ikpeme Erete, Erin Ferguson, Sandip Sen
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 4 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
APPROX
2007
Springer
87views Algorithms» more  APPROX 2007»
14 years 25 days ago
Stochastic Steiner Tree with Non-uniform Inflation
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
ICDE
2007
IEEE
115views Database» more  ICDE 2007»
14 years 10 months ago
Preservation Of Patterns and Input-Output Privacy
Abstract breaches. To do so, the data custodian needs to transform its data. To determine the appropriate transforPrivacy preserving data mining so far has mainly mation, there are...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng,...