1486 search results - page 192 / 298 » Algorithms for two-box covering |
144
click to vote
WSCG
2004
15 years 6 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
116
click to vote
ACL
1998
15 years 5 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
135
click to vote
NIPS
1998
15 years 5 months ago
1998
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
147
click to vote
IWMMDBMS
1996
15 years 5 months ago
1996
The paper describes recent progress in research on database system support for executing multimedia presentations. It proposes the general concept of Reactive Playout Management t...
133
Voted
AIPS
2009
15 years 5 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...