10054 search results - page 297 / 2011 » On the Complexity of Function Learning |
126
click to vote
ACIVS
2006
Springer
15 years 9 months ago
2006
Springer
A new general framework for shape extraction is presented, based on the paradigm of water flow. The mechanism embodies the fluidity of water and hence can detect complex shapes. A ...
115
click to vote
WCC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
140
Voted
ALGOSENSORS
2004
Springer
15 years 9 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
130
click to vote
FAW
2009
Springer
15 years 8 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
135
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...