Sciweavers

Share
ML
2010
ACM
159views Machine Learning» more  ML 2010»
8 years 9 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
PAAPP
2002
101views more  PAAPP 2002»
8 years 11 months ago
Static performance prediction of skeletal parallel programs
We demonstrate that the run time of implicitly parallel programs can be statically predicted with considerable accuracy when expressed within the constraints of a skeletal, shapel...
Yasushi Hayashi, Murray Cole
JPDC
2006
81views more  JPDC 2006»
8 years 11 months ago
Implications of virtualization on Grids for high energy physics applications
The simulations used in the field of high energy physics are compute intensive and exhibit a high level of data parallelism. These features make such simulations ideal candidates ...
Laura Gilbert, Jeff Tseng, Rhys Newman, Saeed Iqba...
CORR
2008
Springer
124views Education» more  CORR 2008»
8 years 11 months ago
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
Daniel Raible, Henning Fernau
ACTAC
2008
94views more  ACTAC 2008»
8 years 11 months ago
Effect Preservation in Transaction Processing in Rule Triggering Systems
Rules provide an expressive means for implementing database behavior: They cope with changes and their ramifications. Rules are commonly used for integrity enforcement, i.e., for ...
Mira Balaban, Steffen Jurk
IWEB
1998
9 years 18 days ago
Using Java for the Coordination of Workflows in the World Wide Web
In this paper we introduce a workflow management system, called WebFlow, which is based on the world wide web and Java as its basic technologies. Java is used as the build time (m...
Michael Weber, Torsten Illmann
IJCAI
2003
9 years 19 days ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...
COLT
2008
Springer
9 years 1 months ago
More Efficient Internal-Regret-Minimizing Algorithms
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
Amy R. Greenwald, Zheng Li, Warren Schudy
ICS
2010
Tsinghua U.
9 years 1 months ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
ECOOPW
1998
Springer
9 years 3 months ago
Is Composition of Metaobjects = Aspect Oriented Programming
This paper proposes to implement aspects as metaobjects and using run time aspect weaving. The metaobjects are metaobjects as defined in computational reflection and can be exchan...
Charlotte Pii Lunau
books