293 search results - page 20 / 59 » Optimal Integer Alphabetic Trees in Linear Time |
157
Voted
HYBRID
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
154
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
107
Voted
COMGEO
2010
ACM
15 years 3 months ago
2010
ACM
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
150
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
135
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...