1715 search results - page 298 / 343 » Point Sample Rendering |
COMPGEOM
1994
ACM
14 years 3 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
AIIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper a novel framework for brain classification is proposed in the context of mental health research. A learning by example method is introduced by combining loc...
CVPR
2007
IEEE
14 years 2 months ago
2007
IEEE
Interactively learning from a small sample of unlabeled examples is an enormously challenging task, one that often arises in vision applications. Relevance feedback and more recen...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
ANTSW
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...