Sciweavers

256 search results - page 24 / 52
» A Unified Approach to Approximating Partial Covering Problem...
Sort
View
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
13 years 12 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
ICML
2008
IEEE
14 years 8 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...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
PERCOM
2005
ACM
14 years 7 months ago
Understanding the real behavior of Mote and 802.11 ad hoc networks: an experimental approach
IEEE 802.11 and Mote devices are today two of the most interesting wireless technologies for ad hoc and sensor networks respectively, and many efforts are currently devoted to und...
Giuseppe Anastasi, Eleonora Borgia, Marco Conti, E...
MKWI
2008
190views Business» more  MKWI 2008»
13 years 9 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb