Sciweavers

1055 search results - page 25 / 211
» Enumerations in computable structure theory
Sort
View
SYNTHESE
2008
69views more  SYNTHESE 2008»
13 years 10 months ago
Dispositional implementation solves the superfluous structure problem
Abstract. Consciousness supervenes on activity; computation supervenes on structure. Because of this, some argue, conscious states cannot supervene on computational ones. If true, ...
Colin Klein
CVPR
2011
IEEE
13 years 6 months ago
Generalized Projection Based M-Estimator: Theory and Applications
We introduce a robust estimator called generalized projection based M-estimator (gpbM) which does not require the user to specify any scale parameters. For multiple inlier structu...
Sushil Mittal, Saket Anand, Peter Meer
EWSN
2004
Springer
14 years 3 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
ADC
2007
Springer
164views Database» more  ADC 2007»
14 years 4 months ago
Computer Assisted Assessment of SQL Query Skills
Structured Query Language (SQL) is the dominant language for querying relational databases today, and is an essential topic in introductory database courses in higher education. E...
Stijn Dekeyser, Michael de Raadt, Tien Yu Lee
WWW
2009
ACM
14 years 10 months ago
Query clustering using click-through graph
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
Jeonghee Yi, Farzin Maghoul