Sciweavers

218 search results - page 13 / 44
» Constant Rate Approximate Maximum Margin Algorithms
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 9 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
MFCS
2009
Springer
14 years 6 days ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
COLT
2000
Springer
13 years 12 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
14 years 8 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor