Sciweavers

1968 search results - page 186 / 394
» The Complexity of Valued Constraint Models
Sort
View
125
Voted
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 2 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
CVPR
2010
IEEE
15 years 10 months ago
Locality-constrained Linear Coding for Image Classification
The traditional SPM approach based on bag-of-features (BoF) must use nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effec...
Jinjun Wang, Jianchao Yang, Kai Yu, Fengjun Lv
CSB
2005
IEEE
133views Bioinformatics» more  CSB 2005»
15 years 7 months ago
Creating a Protein Ontology Resource
Protein Data Integration approaches at the moment considers data sources as data repositories, but not as applications; which in turn may embody complex interactions with other da...
Amandeep S. Sidhu, Tharam S. Dillon, Elizabeth Cha...
125
Voted
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
15 years 6 months ago
Evolving stochastic processes using feature tests and genetic programming
The synthesis of stochastic processes using genetic programming is investigated. Stochastic process behaviours take the form of time series data, in which quantities of interest v...
Brian J. Ross, Janine H. Imada
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 6 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...