8431 search results - page 247 / 1687 » Algorithmically Independent Sequences |
222
click to vote
MLDM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
182
click to vote
APN
2006
Springer
15 years 10 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
194
Voted
ECCV
1996
Springer
16 years 8 months ago
1996
Springer
In Proc. European Conf. Computer Vision, 1996, pp. 357{368, Cambridge, UK The performance of Active Contours in tracking is highly dependent on the availability of an appropriate ...
169
click to vote
JCP
2006
15 years 6 months ago
2006
Data mining is widely used to identify interesting, potentially useful and understandable patterns from a large data repository. With many organizations focusing on webbased on-lin...
232
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...