Sciweavers

2735 search results - page 19 / 547
» Comparing notions of randomness
Sort
View
FSTTCS
1991
Springer
13 years 11 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
ACSC
2009
IEEE
14 years 2 months ago
Using Chronological Splitting to Compare Cross- and Single-company Effort Models: Further Investigation
Numerous studies have used historical datasets to build and validate models for estimating software development effort. Very few used a chronological split (where projects’ end ...
Chris Lokan, Emilia Mendes
ICMI
2003
Springer
99views Biometrics» more  ICMI 2003»
14 years 22 days ago
Selective perception policies for guiding sensing and computation in multimodal systems: a comparative analysis
Intensive computations required for sensing and processing perceptual information can impose significant burdens on personal computer systems. We explore several policies for sel...
Nuria Oliver, Eric Horvitz
CLEF
2008
Springer
13 years 9 months ago
A Comparative Study of Diversity Methods for Hybrid Text and Image Retrieval Approaches
This article compares eight different diversity methods: 3 based on visual information, 1 based on date information, 3 adapted to each topic based on location and visual informatio...
Sabrina Tollari, Philippe Mulhem, Marin Ferecatu, ...
CVPR
2007
IEEE
14 years 9 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
Eric Nowak, Frédéric Jurie