Sciweavers

7129 search results - page 894 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICML
2009
IEEE
15 years 11 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
CIVR
2007
Springer
273views Image Analysis» more  CIVR 2007»
15 years 11 months ago
Scalable near identical image and shot detection
This paper proposes and compares two novel schemes for near duplicate image and video-shot detection. The first approach is based on global hierarchical colour histograms, using ...
Ondrej Chum, James Philbin, Michael Isard, Andrew ...
VTC
2006
IEEE
138views Communications» more  VTC 2006»
15 years 11 months ago
Transmit Precoding for the Multiple Antenna Broadcast Channel
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
Manish Airy, Sandeep Bhadra, Robert W. Heath Jr., ...
ICALP
2004
Springer
15 years 10 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
15 years 10 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...