2168 search results - page 334 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
147
click to vote
SIGGRAPH
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
137
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Due to their ability to model sequential data without making unnecessary independence assumptions, conditional random fields (CRFs) have become an increasingly popular ...
125
click to vote
APSCC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
128
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Because of the large variation across different environments, a generic classifier trained on extensive data-sets may perform sub-optimally in a particular test environment. In th...
168
click to vote
MICCAI
2006
Springer
16 years 4 months ago
2006
Springer
Over the past years many computer aided diagnosis (CAD) schemes have been presented for the detection of colonic polyps in CT Colonography. The vast majority of these methods (impl...