7380 search results - page 363 / 1476 » time 2008 |
209
click to vote
CATS
2008
15 years 8 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
162
click to vote
CCCG
2008
15 years 8 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
181
click to vote
COLING
2008
15 years 8 months ago
2008
This paper elaborates a model for representing semantic calendar expressions (SCEs), which correspond to the intensional meanings of natural-language calendar phrases. The model u...
186
click to vote
ESANN
2008
15 years 8 months ago
2008
The Sensitivity-Based Linear Learning Method (SBLLM) is a learning method for two-layer feedforward neural networks, based on sensitivity analysis, that calculates the weights by s...
188
click to vote
GAMEON
2008
15 years 8 months ago
2008
The increasing complexity of game development highlights the need of intellectual and industrial tools to enhance productivity in terms of quality, time and cost. In this paper we...