28888 search results - page 5502 / 5778 » Computability and complexity in analysis |
134
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
135
click to vote
HICSS
2002
IEEE
15 years 9 months ago
2002
IEEE
The importance of electronic collaboration has risen as successful organisations recognize that they need to convert their intellectual resources into goods and services their cus...
141
click to vote
ICPR
2002
IEEE
15 years 9 months ago
2002
IEEE
We present a fast method for locating iris features in frontal face images based on the Hough transform. It consists of an initial iris detection step and a tracking step which us...
139
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
128
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...