5699 search results - page 219 / 1140 » Alternating model trees |
160
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
184
click to vote
SIBGRAPI
1999
IEEE
15 years 10 months ago
1999
IEEE
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
171
click to vote
ILP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
194
click to vote
NAACL
2004
15 years 7 months ago
2004
The regular occurrence of disfluencies is a distinguishing characteristic of spontaneous speech. Detecting and removing such disfluencies can substantially improve the usefulness ...
154
click to vote
AIPS
2008
15 years 8 months ago
2008
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...