Sciweavers

2376 search results - page 199 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
DSS
2002
82views more  DSS 2002»
13 years 8 months ago
On the discovery of process models from their instances
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
San-Yih Hwang, Wan-Shiou Yang
IJRR
2002
87views more  IJRR 2002»
13 years 7 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram
JMLR
2002
140views more  JMLR 2002»
13 years 7 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
GLOBECOM
2010
IEEE
13 years 6 months ago
Dynamic Resource Allocation Based Partial Crosstalk Cancellation in DSL Networks
The design of crosstalk mitigation techniques for DSL broadband access systems has mainly focused on physical layer transmit rate maximization. However, for certain applications, u...
Beier Li, Paschalis Tsiaflakis, Marc Moonen, Joche...
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
13 years 5 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...