Sciweavers

14518 search results - page 68 / 2904
» Two Problems for Sophistication
Sort
View
CVPR
2011
IEEE
13 years 22 days ago
A Brute-Force Algorithm for Reconstructing a Scene from Two Projections
Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences,...
Olof Enqvist, Fangyuan Jiang, Fredrik Kahl
IDA
2007
Springer
14 years 3 months ago
Two Bagging Algorithms with Coupled Learners to Encourage Diversity
In this paper, we present two ensemble learning algorithms which make use of boostrapping and out-of-bag estimation in an attempt to inherit the robustness of bagging to overfitti...
Carlos Valle, Ricardo Ñanculef, Héct...
EUROPAR
2007
Springer
14 years 27 days ago
Fast and Efficient Total Exchange on Two Clusters
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
Emmanuel Jeannot, Luiz Angelo Steffenel
DMIN
2006
113views Data Mining» more  DMIN 2006»
13 years 10 months ago
Performance Evaluation of Two Data Mining Techniques of Network Alarms Analysis
In large telecommunication networks, alarms are usually useful for identifying faults and, therefore solving them. However, for large systems the number of alarms produced is so la...
Jacques-H. Bellec, M. Tahar Kechadi, Joe Carthy
CCCG
2003
13 years 10 months ago
Shortest Paths in Two Intersecting Pencils of Lines
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
David Hart