Sciweavers

741 search results - page 100 / 149
» A Note on the Use of Independent Sets for the k-SAT Problem
Sort
View
KBSE
2007
IEEE
14 years 3 months ago
Ensuring consistency in long running transactions
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
Jeffrey Fischer, Rupak Majumdar
BMCBI
2011
13 years 3 months ago
NClassG+: A classifier for non-classically secreted Gram-positive bacterial proteins
Background: Most predictive methods currently available for the identification of protein secretion mechanisms have focused on classically secreted proteins. In fact, only two met...
Daniel Restrepo-Montoya, Camilo Pino, Luis F. Ni&n...
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
14 years 9 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
CVPR
2004
IEEE
14 years 10 months ago
Bayesian Fusion of Camera Metadata Cues in Semantic Scene Classification
Semantic scene classification based only on low-level vision cues has had limited success on unconstrained image sets. On the other hand, camera metadata related to capture condit...
Matthew R. Boutell, Jiebo Luo
CVPR
2004
IEEE
14 years 10 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher