Sciweavers

10907 search results - page 2051 / 2182
» Constraint Based Strategies
Sort
View
IPPS
2002
IEEE
15 years 2 months ago
Can User-Level Protocols Take Advantage of Multi-CPU NICs?
Modern high speed interconnects such as Myrinet and Gigabit Ethernet have shifted the bottleneck in communication from the interconnect to the messaging software at the sending an...
Piyush Shivam, Pete Wyckoff, Dhabaleswar K. Panda
IPPS
2002
IEEE
15 years 2 months ago
Enforcing Resource Sharing Agreements among Distributed Server Clusters
Future scalable, high throughput, and high performance applications are likely to execute on platforms constructed by clustering multiple autonomous distributed servers, with reso...
Tao Zhao, Vijay Karamcheti
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
15 years 2 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
ICA3PP
2010
Springer
15 years 2 months ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
ITS
2010
Springer
178views Multimedia» more  ITS 2010»
15 years 2 months ago
Learning What Works in ITS from Non-traditional Randomized Controlled Trial Data
The traditional, well established approach to finding out what works in education research is to run a randomized controlled trial (RCT) using a standard pretest and posttest desig...
Zachary A. Pardos, Matthew D. Dailey, Neil T. Heff...
« Prev « First page 2051 / 2182 Last » Next »