Sciweavers

3367 search results - page 502 / 674
» Incremental assignment problem
Sort
View
ICML
2010
IEEE
15 years 4 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
HUC
2010
Springer
15 years 4 months ago
Tasking networked CCTV cameras and mobile phones to identify and localize multiple people
We present a method to identify and localize people by leveraging existing CCTV camera infrastructure along with inertial sensors (accelerometer and magnetometer) within each pers...
Thiago Teixeira, Deokwoo Jung, Andreas Savvides
AMAI
2008
Springer
15 years 4 months ago
Recognition of interval Boolean functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their ...
Ondrej Cepek, David Kronus, Petr Kucera
BMCBI
2008
114views more  BMCBI 2008»
15 years 3 months ago
Combining classifiers for improved classification of proteins from sequence or structure
Background: Predicting a protein's structural or functional class from its amino acid sequence or structure is a fundamental problem in computational biology. Recently, there...
Iain Melvin, Jason Weston, Christina S. Leslie, Wi...
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 3 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap