4372 search results - page 525 / 875 » Algorithmic Theories of Everything |
163
click to vote
COMPGEOM
2004
ACM
16 years 8 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
184
click to vote
ICML
2004
IEEE
16 years 8 days ago
2004
IEEE
In this work we consider the task of relaxing the i.i.d assumption in online pattern recognition (or classification), aiming to make existing learning algorithms applicable to a ...
193
click to vote
PADS
2004
ACM
16 years 8 days ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
178
click to vote
SIGIR
2004
ACM
16 years 8 days ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
170
click to vote
VRST
2004
ACM
16 years 7 days ago
2004
ACM
An important, potential application of image-based techniques is to create photo-realistic image-based environments for interactive walkthrough. However, existing image-based stud...