Sciweavers

3946 search results - page 248 / 790
» The computational complexity of choice sets
Sort
View
ICCV
2011
IEEE
14 years 6 months ago
Annotator Rationales for Visual Recognition
Traditional supervised visual learning simply asks annotators “what” label an image should have. We propose an approach for image classification problems requiring subjective...
Jeff Donahue, Kristen Grauman
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 26 days ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
COMPGEOM
2004
ACM
16 years 4 days ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
146
Voted
HUC
2009
Springer
15 years 11 months ago
The commodification of location: dynamics of power in location-based systems
Location-based ubiquitous computing systems are entering mainstream society and becoming familiar parts of everyday life. However, the settings in which they are deployed are alre...
Irina Shklovski, Janet Vertesi, Emily Troshynski, ...
ITC
1994
IEEE
111views Hardware» more  ITC 1994»
15 years 10 months ago
Simulation Results of an Efficient Defect-Analysis Procedure
For obtaining a zero defect level, a high fault coverage with respect to the stuck-at fault model is often not sufficient as there are many defects that show a more complex behavi...
Olaf Stern, Hans-Joachim Wunderlich