Sciweavers

10608 search results - page 701 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICML
2004
IEEE
16 years 8 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer
ISBI
2008
IEEE
16 years 8 months ago
Advanced level-set based multiple-cell segmentation and tracking in time-lapse fluorescence microscopy images
Segmentation and tracking of cells in fluorescence microscopy image sequences is an important task in many biological studies into cell migration as well as intracellular dynamics...
Oleh Dzyubachyk, Wiro J. Niessen, Erik H. W. Meije...
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 7 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
INFOCOM
2009
IEEE
16 years 2 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
16 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith