5326 search results - page 361 / 1066 » On what we can ensure |
163
click to vote
CCCG
2008
15 years 8 months ago
2008
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
158
click to vote
ALENEX
2004
15 years 8 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
178
click to vote
DMIN
2006
15 years 8 months ago
2006
- Filtering the immense amount of data available electronically over the World Wide Web is an important task of search engines in data mining applications. Users when performing se...
155
click to vote
ESANN
2006
15 years 8 months ago
2006
Abstract. We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourcef...
175
click to vote
EUMAS
2006
15 years 8 months ago
2006
Well-known approaches for the ontology mapping can be grouped into lexical, semantic, and structural ones. We assume that the approaches are complementary to each other and their ...