1732 search results - page 260 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
198
click to vote
SIGGRAPH
1992
ACM
15 years 10 months ago
1992
ACM
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at var...
142
click to vote
ADBIS
2001
Springer
15 years 10 months ago
2001
Springer
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
166
click to vote
TIT
2008
15 years 6 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
176
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper, we present a Deformable Action Template
(DAT) model that is learnable from cluttered real-world
videos with weak supervisions. In our generative model,
an action ...
152
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...