Sciweavers

3702 search results - page 630 / 741
» Reducing Misclassification Costs
Sort
View
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
14 years 2 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
APCSAC
2003
IEEE
14 years 1 months ago
Simultaneous MultiStreaming for Complexity-Effective VLIW Architectures
Very Long Instruction Word (VLIW) architectures exploit instruction level parallelism (ILP) with the help of the compiler to achieve higher instruction throughput with minimal hard...
Pradeep Rao, S. K. Nandy, M. N. V. Satya Kiran
CLUSTER
2001
IEEE
14 years 1 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
PLDI
1995
ACM
14 years 1 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove
CF
2005
ACM
14 years 1 days ago
An efficient wakeup design for energy reduction in high-performance superscalar processors
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...
Kuo-Su Hsiao, Chung-Ho Chen