Sciweavers

2423 search results - page 152 / 485
» AnswerArt - Contextualized Question Answering
Sort
View
COCOON
2003
Springer
15 years 11 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
FOCS
2002
IEEE
15 years 11 months ago
Market Equilibrium via a Primal-Dual-Type Algorithm
We provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891, thereby partially answering an open questio...
Nikhil R. Devanur, Christos H. Papadimitriou, Amin...
FSTTCS
2001
Springer
15 years 11 months ago
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
Eric Allender
FOSSACS
2006
Springer
15 years 10 months ago
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
Petr Jancar, Jirí Srba
AAAI
2008
15 years 8 months ago
Text Categorization with Knowledge Transfer from Heterogeneous Data Sources
Multi-category classification of short dialogues is a common task performed by humans. When assigning a question to an expert, a customer service operator tries to classify the cu...
Rakesh Gupta, Lev-Arie Ratinov