8824 search results - page 298 / 1765 » On the Complexity of Real Functions |
191
click to vote
RITA
2002
15 years 6 months ago
2002
The use of detailed geometric models is a critical factor for achieving realism in most computer graphics applications. In the past few years, we have observed an increasing deman...
209
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
179
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
198
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
182
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...