1403 search results - page 136 / 281 » About Approximations of Exponentials |
154
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
128
click to vote
WEBI
2005
Springer
15 years 10 months ago
2005
Springer
The performance of an ontology alignment technique largely depends on the amount of information that can be leveraged for the alignment task. On the Semantic Web, end-users may ex...
141
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
158
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
The problem of coalition formation when agents are uncertain about the types or capabilities of their potential partners is a critical one. In [3] a Bayesian reinforcement learnin...
ICMCS
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we propose a wide-range image sensing method using a camera thrown up into the air. By using camera thrown up in this way, we can get images that are otherwise diff...