4047 search results - page 340 / 810 » Some Properties and Some Problems on Set Functors |
204
Voted
JMLR
2010
15 years 1 months ago
2010
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
194
click to vote
CANS
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
142
click to vote
ICC
2007
IEEE
16 years 28 days ago
2007
IEEE
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). In this work, we study the problem of desig...
171
click to vote
APNOMS
2007
Springer
16 years 24 days ago
2007
Springer
We propose a greedy algorithm to investigate the problem of how to schedule of a set of feasible transmissions under physical interference model. We also consider the fairness in s...
179
click to vote
BIOWIRE
2007
Springer
16 years 24 days ago
2007
Springer
In this chapter, we present some of the biologically-inspired approaches, developed within the context of the European project BIONETS for enabling autonomic pervasive computing en...