Sciweavers

62 search results - page 4 / 13
» Approximating Node-Connectivity Augmentation Problems
Sort
View
IJAR
2010
105views more  IJAR 2010»
14 years 6 months ago
A tree augmented classifier based on Extreme Imprecise Dirichlet Model
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
G. Corani, C. P. de Campos
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
15 years 3 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
INFOCOM
2008
IEEE
15 years 3 months ago
Minimum Cost Topology Construction for Rural Wireless Mesh Networks
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
Debmalya Panigrahi, Partha Dutta, Sharad Jaiswal, ...
AAAI
2007
14 years 11 months ago
Approximate Query Answering in Locally Closed Databases
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
Alvaro Cortés-Calabuig, Marc Denecker, Ofer...
ICML
2008
IEEE
15 years 10 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...