Sciweavers

1390 search results - page 245 / 278
» Computing the depth of a flat
Sort
View
AAAI
2008
15 years 1 days ago
Learning Grasp Strategies with Partial Shape Information
We consider the problem of grasping novel objects in cluttered environments. If a full 3-d model of the scene were available, one could use the model to estimate the stability and...
Ashutosh Saxena, Lawson L. S. Wong, Andrew Y. Ng
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
LREC
2010
146views Education» more  LREC 2010»
14 years 11 months ago
A Pilot Arabic CCGbank
We describe a process for converting the Penn Arabic Treebank into the CCG formalism. Previous efforts have yielded CCGbanks in English, German, and Turkish, thus opening these la...
Stephen A. Boxwell, Chris Brew
GRAPHICSINTERFACE
2007
14 years 11 months ago
A method for cartoon-style rendering of liquid animations
In this paper we present a visually compelling and informative cartoon rendering style for liquid animations. Our style is inspired by animations such as Futurama,1 The Little Mer...
Ashley M. Eden, Adam W. Bargteil, Tolga G. Gokteki...
GRAPHICSINTERFACE
2007
14 years 11 months ago
Feature peeling
We present a novel rendering algorithm that analyses the ray profiles along the line of sight. The profiles are subdivided according to encountered peaks and valleys at so calle...
Muhammad Muddassir Malik, Torsten Möller, M. ...