Sciweavers

712 search results - page 58 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
NIPS
2007
15 years 4 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch
CAD
2008
Springer
15 years 3 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
CGO
2008
IEEE
15 years 9 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
CONNECTION
2004
93views more  CONNECTION 2004»
15 years 2 months ago
A real-time robotic model of human reference resolution using visual constraints
Evidence from recent psycholinguistic experiments suggests that humans resolve reference incrementally in the presence of constraining visual context. In this paper, we present an...
Matthias Scheutz, Kathleen M. Eberhard, Virgil And...
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
15 years 9 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...