4679 search results - page 195 / 936 » Modeling When Connections Are the Problem |
118
Voted
WADS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
146
click to vote
CONCUR
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
137
click to vote
EUROCRYPT
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
150
Voted
STOC
2006
ACM
16 years 5 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
125
click to vote
AIEDU
2007
15 years 5 months ago
2007
Opening a model of the learner is a potentially complex operation. There are many aspects of the learner that can be modelled, and many of these aspects may need to be opened in di...