Sciweavers

12264 search results - page 409 / 2453
» An Analysis of the XSL Algorithm
Sort
View
PR
2010
163views more  PR 2010»
15 years 5 months ago
A comparative evaluation of interactive segmentation algorithms
In this paper we present a comparative evaluation of four popular interactive segmentation algorithms. The evaluation was carried out as a series of user-experiments, in which par...
Kevin McGuinness, Noel E. O'Connor
ITIIS
2010
158views more  ITIIS 2010»
15 years 1 months ago
Development of a Dynamic Collision Avoidance Algorithm for Indoor Tracking System Based on Active RFID
We propose a novel collision-avoidance algorithm for the active type RFID regarding an indoor tracking system. Several well-known collision avoidance algorithms are analyzed consi...
Sekyung Han, Yeonsuk Choi, Masayuki Iwai, Kaoru Se...
CORR
2011
Springer
127views Education» more  CORR 2011»
14 years 10 months ago
Generalized Boosting Algorithms for Convex Optimization
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
Alexander Grubb, J. Andrew Bagnell
WWW
2005
ACM
16 years 7 months ago
Can link analysis tell us about web traffic?
In this paper we measure correlation between link analysis characteristics for Web pages such as in- and out-degree, PageRank and RBS with those obtained from real Web traffic ana...
Marcin Sydow
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 7 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink