5302 search results - page 279 / 1061 » Learning How to Separate |
171
click to vote
KER
2007
15 years 6 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
182
click to vote
APPT
2009
Springer
16 years 1 months ago
2009
Springer
SIMD extension is one of the most common and effective technique to exploit data-level parallelism in today’s processor designs. However, the performance of SIMD architectures i...
163
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a new method to partition an unlabeled dataset, called Discriminative Context Partitioning (DCP). It is motivated by the idea of splitting the dataset based only on how...
154
click to vote
ACCV
2007
Springer
16 years 24 days ago
2007
Springer
We consider the problem of L2-optimal triangulation from three separate views. Triangulation is an important part of numerous computer vision systems. Under gaussian noise, minimiz...
182
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...