Sciweavers

6202 search results - page 322 / 1241
» Without Loss of Generality
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
KDD
2010
ACM
242views Data Mining» more  KDD 2010»
15 years 8 months ago
A scalable two-stage approach for a class of dimensionality reduction techniques
Dimensionality reduction plays an important role in many data mining applications involving high-dimensional data. Many existing dimensionality reduction techniques can be formula...
Liang Sun, Betul Ceran, Jieping Ye
CVPR
2006
IEEE
16 years 8 months ago
Unsupervised Bayesian Detection of Independent Motion in Crowds
While crowds of various subjects may offer applicationspecific cues to detect individuals, we demonstrate that for the general case, motion itself contains more information than p...
Gabriel J. Brostow, Roberto Cipolla
CP
2009
Springer
16 years 7 months ago
On the Power of Clause-Learning SAT Solvers with Restarts
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
Knot Pipatsrisawat, Adnan Darwiche
WOWMOM
2009
ACM
130views Multimedia» more  WOWMOM 2009»
16 years 1 months ago
Interference aware route optimization with predicted network conditions
The basic idea presented in this paper is to use interference aware routing with predicted interference. Noise and other values are measured over a long time and within a wide are...
Till Wollenberg, Thomas Mundt