Sciweavers

1772 search results - page 300 / 355
» Classifying Problems into Complexity Classes
Sort
View
TCS
2010
13 years 4 months ago
A fluid analysis framework for a Markovian process algebra
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
Richard A. Hayden, Jeremy T. Bradley
CVPR
2006
IEEE
15 years 3 days ago
Hidden Conditional Random Fields for Gesture Recognition
We introduce a discriminative hidden-state approach for the recognition of human gestures. Gesture sequences often have a complex underlying structure, and models that can incorpo...
Sy Bor Wang, Ariadna Quattoni, Louis-Philippe More...
ALT
1995
Springer
14 years 1 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
PODS
2010
ACM
223views Database» more  PODS 2010»
13 years 12 months ago
Characterizing schema mappings via data examples
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan
BIRTHDAY
2010
Springer
13 years 11 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman