Sciweavers

903 search results - page 4 / 181
» Non-well-founded trees in categories
Sort
View
AUTONOMICS
2008
ACM
15 years 1 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber
ML
2008
ACM
135views Machine Learning» more  ML 2008»
14 years 11 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
16 years 2 days ago
A data mining approach to modeling relationships among categories in image collection
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...
Ruofei Zhang, Zhongfei (Mark) Zhang, Sandeep Khanz...
ICALP
1989
Springer
15 years 3 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano
ACL
2012
13 years 2 months ago
Robust Conversion of CCG Derivations to Phrase Structure Trees
We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simp...
Jonathan K. Kummerfeld, Dan Klein, James R. Curran