Sciweavers

3927 search results - page 154 / 786
» Dynamic Dependencies and Performance Improvement
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
15 years 11 months ago
Improving data mining utility with projective sampling
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
Mark Last
EMNLP
2007
15 years 8 months ago
Structured Prediction Models via the Matrix-Tree Theorem
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
Terry Koo, Amir Globerson, Xavier Carreras, Michae...
ACL
1998
15 years 8 months ago
General-to-Specific Model Selection for Subcategorization Preference
This paper proposes a novel method for learning probability models of subcategorization preference of verbs. We consider the issues of case dependencies and noun class generalizat...
Takehito Utsuro, Takashi Miyata, Yuji Matsumoto
MICRO
1998
IEEE
89views Hardware» more  MICRO 1998»
15 years 10 months ago
Load Latency Tolerance in Dynamically Scheduled Processors
This paper provides quantitative measurements of load latency tolerance in a dynamically scheduled processor. To determine the latency tolerance of each memory load operation, our...
Srikanth T. Srinivasan, Alvin R. Lebeck
EUROPAR
2003
Springer
15 years 11 months ago
Dynamic Load Balancing for I/O- and Memory-Intensive Workload in clusters Using a Feedback Control Mechanism
1 One common assumption of the existing models of load balancing is that the weights of resources and I/O buffer size are statically configured. Though the static configuration ...
Xiao Qin, Hong Jiang, Yifeng Zhu, David R. Swanson