Sciweavers

1578 search results - page 179 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
CCR
2005
131views more  CCR 2005»
13 years 10 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 4 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
VIS
2003
IEEE
247views Visualization» more  VIS 2003»
14 years 11 months ago
Shape Simplification Based on the Medial Axis Transform
We present a new algorithm for simplifying the shape of 3D objects by manipulating their medial axis transform (MAT). From an unorganized set of boundary points, our algorithm com...
Roger C. Tam, Wolfgang Heidrich
ICML
2002
IEEE
14 years 11 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
PAM
2009
Springer
14 years 4 months ago
Access Point Localization Using Local Signal Strength Gradient
Abstract. Many previous studies have examined the placement of access points (APs) to improve the community’s understanding of the deployment and behavioral characteristics of wi...
Dongsu Han, David G. Andersen, Michael Kaminsky, K...