Sciweavers

318 search results - page 59 / 64
» Investigation of Question Classifier in Question Answering
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 4 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
COCOON
2007
Springer
15 years 3 months ago
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
Christian Glaßer, Alan L. Selman, Liyu Zhang
SOFSEM
2007
Springer
15 years 3 months ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean
ISPW
2005
IEEE
15 years 3 months ago
Software are Processes Too
A process defines the way activities are organized, managed, measured, supported and improved to reach a goal. It has been shown, 15 years ago [1] that processes are software too; ...
Jacky Estublier
INFOCOM
2003
IEEE
15 years 2 months ago
Modeling Peer-Peer File Sharing Systems
— Peer-peer networking has recently emerged as a new paradigm for building distributed networked applications. In this paper we develop simple mathematical models to explore and ...
Zihui Ge, Daniel R. Figueiredo, Sharad Jaiswal, Ja...