467 search results - page 80 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
141
click to vote
STOC
2000
ACM
15 years 4 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
101
click to vote
RTSS
1992
IEEE
15 years 3 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
181
click to vote
GIS
2004
ACM
16 years 23 days ago
2004
ACM
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
110
click to vote
ICML
2009
IEEE
15 years 6 months ago
2009
IEEE
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...