Sciweavers

675 search results - page 95 / 135
» Biased Range Trees
Sort
View
108
Voted
IJCAI
1997
15 years 10 days ago
Minimum Splits Based Discretization for Continuous Features
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
Ke Wang, Han Chong Goh
IJCAI
1993
15 years 10 days ago
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Usama M. Fayyad, Keki B. Irani
INFORMS
2008
241views more  INFORMS 2008»
14 years 11 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
JFR
2008
87views more  JFR 2008»
14 years 11 months ago
Hough based terrain classification for realtime detection of drivable ground
The usability of mobile robots for surveillance, search and rescue missions can be significantly improved by intelligent functionalities decreasing the cognitive load on the opera...
Jann Poppinga, Andreas Birk 0002, Kaustubh Pathak
JQL
2008
97views more  JQL 2008»
14 years 11 months ago
Dependency-length minimization in natural and artificial languages
A wide range of evidence points to a preference for syntactic structures in which dependencies are short. Here we examine the question: what kinds of dependency configurations min...
David Temperley