Sciweavers

338 search results - page 62 / 68
» Approximation Spaces and Information Granulation
Sort
View
CIKM
1999
Springer
13 years 11 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
13 years 11 months ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
CIKM
2008
Springer
13 years 9 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
IJCAI
1997
13 years 8 months ago
Combining Probabilistic Population Codes
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
Richard S. Zemel, Peter Dayan
ESANN
2006
13 years 8 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi