Sciweavers

4843 search results - page 743 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
117
Voted
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
15 years 5 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman
115
Voted
DMIN
2006
106views Data Mining» more  DMIN 2006»
15 years 5 months ago
A Medical Claim Fraud/Abuse Detection System based on Data Mining: A Case Study in Chile
This paper describes an effective medical claim fraud/abuse detection system based on data mining used by a Chilean private health insurance company. Fraud and abuse in medical cla...
Pedro A. Ortega, Cristián J. Figueroa, Gonz...
97
Voted
IADIS
2004
15 years 5 months ago
Electronic case studies: a problem-based learning approach
E-Cases is an innovative approach to management development. Traditional case studies typically describe a decision or a problem in a real-life setting. E-Cases encourage students...
Philip M. Drinkwater, Christopher P. Holland, K. N...
124
Voted
ESANN
2003
15 years 5 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
133
Voted
NIPS
2001
15 years 5 months ago
Estimating Car Insurance Premia: a Case Study in High-Dimensional Data Inference
Estimating insurance premia from data is a difficult regression problem for several reasons: the large number of variables, many of which are discrete, and the very peculiar shape...
Nicolas Chapados, Yoshua Bengio, Pascal Vincent, J...