Sciweavers

1004 search results - page 166 / 201
» A comparison of generalized linear discriminant analysis alg...
Sort
View
CPAIOR
2006
Springer
14 years 11 days ago
Duality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
John N. Hooker
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 1 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
PODC
2005
ACM
14 years 2 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CIVR
2007
Springer
231views Image Analysis» more  CIVR 2007»
14 years 2 months ago
Classification of video events using 4-dimensional time-compressed motion features
Among the various types of semantic concepts modeled, events pose the greatest challenge in terms of computational power needed to represent the event and accuracy that can be ach...
Alexander Haubold, Milind R. Naphade
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 9 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi