Sciweavers

10996 search results - page 2160 / 2200
» Future Directions in Computing
Sort
View
NIPS
2001
13 years 10 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
IJCAI
2003
13 years 10 months ago
A Planning Algorithm for Predictive State Representations
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
Masoumeh T. Izadi, Doina Precup
VMV
2004
185views Visualization» more  VMV 2004»
13 years 10 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
AAAI
2000
13 years 10 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava
ACL
1997
13 years 10 months ago
A Theory of Parallelism and the Case of VP Ellipsis
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...
Jerry R. Hobbs, Andrew Kehler
« Prev « First page 2160 / 2200 Last » Next »