Sciweavers

1381 search results - page 241 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
VISSYM
2007
13 years 10 months ago
Hardware-accelerated Stippling of Surfaces derived from Medical Volume Data
We present a fast hardware-accelerated stippling method which does not require any preprocessing for placing points on surfaces. The surfaces are automatically parameterized in or...
Alexandra Baer, Christian Tietjen, Ragnar Bade, Be...
DLOG
2007
13 years 10 months ago
Action Based ABox Update: an Example from the Chemical Compound Formulation
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
Alessandro Mosca, Matteo Palmonari
COMPGEOM
2008
ACM
13 years 9 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
LREC
2010
127views Education» more  LREC 2010»
13 years 9 months ago
Expanding the Lexicon for a Resource-Poor Language Using a Morphological Analyzer and a Web Crawler
Resource-poor languages may suffer from a lack of any of the basic resources that are fundamental to computational linguistics, including an adequate digital lexicon. Given the re...
Michael Gasser
SIROCCO
2008
13 years 9 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau