16666 search results - page 2878 / 3334 » Descriptive and Computational Complexity |
172
click to vote
VVS
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splat...
190
click to vote
SIGCSE
2000
ACM
15 years 11 months ago
2000
ACM
Being exposed to well-written code is a valuable experience for students -- especially when the code is larger or more complex than they are currently capable of writing. In addit...
179
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
174
click to vote
CIKM
2000
Springer
15 years 11 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
156
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...