Sciweavers

8437 search results - page 126 / 1688
» Preferences over Sets
Sort
View
EOR
2006
74views more  EOR 2006»
15 years 6 months ago
A set theoretic framework for enumerating matches in surveys and its application to reducing inaccuracies in vehicle roadside su
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
Richard G. Clegg
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
13 years 8 months ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett
METRICS
2005
IEEE
15 years 12 months ago
An Empirical Analysis of Software Productivity over Time
OBJECTIVE - the aim is to investigate how software project productivity has changed over time. Within this overall goal we also compare productivity between different business sec...
Rahul Premraj, Martin J. Shepperd, Barbara A. Kitc...
CORR
1999
Springer
65views Education» more  CORR 1999»
15 years 6 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
CVPR
2007
IEEE
16 years 8 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell