Sciweavers

3575 search results - page 8 / 715
» Presentations of computably enumerable reals
Sort
View
CW
2002
IEEE
15 years 2 months ago
Adaptive Content Model for Multimedia Presentation
Multimedia presentation systems require flexible support for the modeling of multimedia content models. Many presentation systems provide the synchronized, sequential or concurren...
L. Y. Deng, R.-X. Chen, R.-C. Chang, T.-S. Huang
104
Voted
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
15 years 6 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
75
Voted
STACS
2001
Springer
15 years 1 months ago
Randomness, Computability, and Density
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
CASES
2004
ACM
15 years 1 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
87
Voted
COMPGEOM
1995
ACM
15 years 1 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner