Sciweavers

2470 search results - page 299 / 494
» Adaptive Peer Selection
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 6 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
TIT
2002
102views more  TIT 2002»
15 years 6 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein
ICIP
2009
IEEE
15 years 4 months ago
New CAVLC design for lossless intra coding
The context-based adaptive variable length coder (CAVLC) in H.264/AVC is not appropriate for lossless video coding because it was designed for lossy video coding. Since statistica...
Jin Heo, Seung Hwan Kim, Yo-Sung Ho
COLING
2010
15 years 1 months ago
Simplicity is Better: Revisiting Single Kernel PPI Extraction
It has been known that a combination of multiple kernels and addition of various resources are the best options for improving effectiveness of kernel-based PPI extraction methods....
Sung-Pil Choi, Sung-Hyon Myaeng
ICIP
2007
IEEE
16 years 8 months ago
MuFeSaC: Learning When to Use Which Feature Detector
Interest point detectors are the starting point in image analysis for depth estimation using epipolar geometry and camera ego-motion estimation. With several detectors defined in ...
Sreenivas R. Sukumar, David L. Page, Hamparsum Boz...