Sciweavers

334 search results - page 28 / 67
» Efficient Algorithms for the Tree Homeomorphism Problem
Sort
View
ICCV
2009
IEEE
15 years 1 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
AAAI
1998
13 years 9 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
IPPS
1999
IEEE
14 years 22 days ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka
ICDT
2007
ACM
105views Database» more  ICDT 2007»
14 years 10 days ago
Unlocking Keys for XML Trees
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
Sven Hartmann, Sebastian Link
AINA
2006
IEEE
14 years 2 months ago
Peer-Tree: A Hybrid Peer-to-Peer Overlay for Service Discovery
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
Jing Tie, Hai Jin, Shengli Li, Xuanhua Shi, Hanhua...