3946 search results - page 360 / 790 » The computational complexity of choice sets |
215
click to vote
TIP
2010
15 years 1 months ago
2010
This paper addresses variational supervised texture segmentation. The main contributions are twofold. First, the proposed method circumvents a major problem related to classical t...
204
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
199
click to vote
PARA
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. By simulating a real computer it is possible to gain a detailed knowledge of the cache memory utilization of an application, e.g., a partial differential equation (PDE) s...
221
click to vote
SIBGRAPI
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an output-sensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular ...
231
click to vote
TRIDENTCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Deploying and controlling experiments running on a distributed set of resources is a challenging task. Software developers often spend a significant amount of time dealing with the...