4679 search results - page 579 / 936 » Modeling When Connections Are the Problem |
251
click to vote
JMLR
2012
13 years 10 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
222
Voted
ASIACRYPT
2010
Springer
15 years 5 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
205
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
245
click to vote
PODS
1994
ACM
15 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
184
click to vote
DCOSS
2008
Springer
15 years 9 months ago
2008
Springer
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...