128 search results - page 12 / 26 » An Implicit Characterization of PSPACE |
106
Voted
FOCS
2008
IEEE
14 years 11 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
DM
2006
14 years 10 months ago
2006
Within a large family of crossover designs this paper characterizes the mathematical structures of A-optimal and A-efficient crossover designs for the purpose of statistical compa...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
- In this work we are analyzing scalability of the heuristic algorithm we used in the past [1-4] to discover knowledge from multi-valued symbolic attributes in fuzzy databases. The...
WSDM
2012
ACM
2012
ACM
Large-scale analysis of individual and task differences in search result page examination strategies
13 years 5 months ago
Understanding the impact of individual and task differences on search result page examination strategies is important in developing improved search engines. Characterizing these e...