Sciweavers

5964 search results - page 948 / 1193
» A theory of speculative computation
Sort
View
MFCS
2004
Springer
16 years 2 days ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
SAT
2004
Springer
101views Hardware» more  SAT 2004»
16 years 2 days ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
ENC
2003
IEEE
16 years 14 hour ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
HAPTICS
2003
IEEE
16 years 13 hour ago
Dynamic Local Models for Stable Multi-Contact Haptic Interaction with Deformable Objects
This paper describes a new technique for allowing multiple users to haptically interact with a set of deformable slowly-simulated objects in a stable manner. Stability has been ap...
Federico Barbagli, John Kenneth Salisbury Jr., Dom...
180
Voted
ICNP
2003
IEEE
16 years 8 hour ago
Optimal Resource Allocation in Overlay Multicast
This paper targets the problem of optimal resource allocation in overlay multicast, which poses both theoretical and practical challenges. Theoretically, resource allocation among...
Yi Cui, Yuan Xue, Klara Nahrstedt