373 search results - page 55 / 75 » On the Iterated Hairpin Completion |
AAAI
2006
13 years 8 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
IC
2003
13 years 8 months ago
2003
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
NIPS
2003
13 years 8 months ago
2003
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
CVPR
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a novel approach for robust localization of multiple people observed using multiple cameras. We use this location information to generate sports visualizations, which i...