Sciweavers

507 search results - page 60 / 102
» Sizes of Ordered Decision Trees
Sort
View
IPPS
2000
IEEE
13 years 11 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
CPAIOR
2011
Springer
12 years 11 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan
HICSS
2007
IEEE
139views Biometrics» more  HICSS 2007»
14 years 2 months ago
Ontology Driven CPG Authoring and Execution via a Semantic Web Framework
Clinical Practice Guidelines (CPG) are used by healthcare practitioners to standardize clinical practice and to provide evidence mediated health-care. Currently, there have been c...
Sajjad Hussain, Syed Sibte Raza Abidi
LICS
2009
IEEE
14 years 2 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos
NAACL
2010
13 years 5 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad