Sciweavers

3946 search results - page 213 / 790
» The computational complexity of choice sets
Sort
View
CF
2005
ACM
15 years 8 months ago
A case for a working-set-based memory hierarchy
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...
Steve Carr, Soner Önder
CVPR
2006
IEEE
16 years 8 months ago
A Simple Bayesian Framework for Content-Based Image Retrieval
We present a Bayesian framework for content-based image retrieval which models the distribution of color and texture features within sets of related images. Given a userspecified ...
Katherine A. Heller, Zoubin Ghahramani
TIP
2002
97views more  TIP 2002»
15 years 6 months ago
Affine invariants of convex polygons
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...
Jan Flusser
ICCS
2003
Springer
15 years 12 months ago
Self-Adapting Numerical Software and Automatic Tuning of Heuristics
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
Jack Dongarra, Victor Eijkhout
CGI
1998
IEEE
15 years 11 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...