900 search results - page 100 / 180 » On Polynomial Time Computation over Unordered Structures |
KDD
2012
ACM
11 years 11 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
ICONS
2008
IEEE
14 years 3 months ago
2008
IEEE
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
In this paper we present a probabilistic framework for tracking regions based on their appearance. We exploit the feature-spatial distribution of a region representing an object a...
IJCNN
2007
IEEE
14 years 3 months ago
2007
IEEE
— We present a computational model of human category learning that learns the essential structures of the categories by forgetting information that is not useful for the given ta...