1124 search results - page 108 / 225 » Constructing Common Information Spaces |
134
click to vote
PASTE
1998
ACM
15 years 8 months ago
1998
ACM
Concept analysis transforms any relation between ‘lobjects” and “attributes” into a complete lattice. This concept lattice can be studied by algebraic means and offers rem...
114
click to vote
AIPS
2006
15 years 6 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
175
Voted
AIPS
2009
15 years 5 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
165
Voted
ICDE
2009
IEEE
15 years 2 months ago
2009
IEEE
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
152
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...