Sciweavers

77 search results - page 13 / 16
» Optimizing over the split closure
Sort
View
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 10 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 9 months ago
Small Is Not Always Beautiful
Peer-to-peer content distribution systems have been enjoying great popularity, and are now gaining momentum as a means of disseminating video streams over the Internet. In many of...
Pawel Marciniak, Nikitas Liogkas, Arnaud Legout, E...
SIGPRO
2010
135views more  SIGPRO 2010»
13 years 7 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
MOR
2002
94views more  MOR 2002»
13 years 8 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
COMCOM
2008
120views more  COMCOM 2008»
13 years 9 months ago
Game theoretic models for detecting network intrusions
In this paper, we study using game theory the problem of detecting intrusions in wired infrastructure networks. Detection is accomplished by sampling a subset of the transmitted p...
Hadi Otrok, Mona Mehrandish, Chadi Assi, Mourad De...