Sciweavers

2412 search results - page 381 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
WSCG
2004
156views more  WSCG 2004»
13 years 9 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
SWAP
2007
13 years 9 months ago
Who the FOAF knows Alice? RDF Revocation in DBin 2.0
In this paper we take a view from the bottom to RDF(S) reasoning. We discuss some issues and requirements on reasoning towards effectively building Semantic Web Pipes, aggregating ...
Christian Morbidoni, Axel Polleres, Giovanni Tumma...
GRID
2008
Springer
13 years 8 months ago
Dynamic scheduling for heterogeneous Desktop Grids
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the res...
Issam Al-Azzoni, Douglas G. Down
ENTCS
2008
122views more  ENTCS 2008»
13 years 7 months ago
Concurrency in Biological Modeling: Behavior, Execution and Visualization
Modeling natural systems is a complicated task that involves the concurrent behavior of various processes, mechanisms and objects. Here, we describe an approach that we have been ...
David Harel, Yaki Setty, Sol Efroni, Naamah Swerdl...
IDA
2006
Springer
13 years 7 months ago
Structural hidden Markov models: An application to handwritten numeral recognition
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
Djamel Bouchaffra, Jun Tan