900 search results - page 100 / 180 » On Polynomial Time Computation over Unordered Structures |
167
click to vote
KDD
2012
ACM
13 years 7 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...
153
click to vote
ICONS
2008
IEEE
15 years 11 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 ...
172
click to vote
COMGEO
2008
ACM
15 years 4 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...
151
click to vote
CVPR
2003
IEEE
16 years 6 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...
121
click to vote
IJCNN
2007
IEEE
15 years 11 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...