Sciweavers

7167 search results - page 924 / 1434
» Answer Set Programming
Sort
View
IR
2010
15 years 2 months ago
Sentence-level event classification in unstructured texts
The ability to correctly classify sentences that describe events is an important task for many natural language applications such as Question Answering (QA) and Text Summarisation....
Martina Naughton, Nicola Stokes, Joe Carthy
AML
2011
204views Mathematics» more  AML 2011»
14 years 11 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
TON
2010
221views more  TON 2010»
14 years 11 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 8 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 8 months ago
How schema independent are schema free query interfaces?
— Real-world databases often have extremely complex schemas. With thousands of entity types and relationships, each with a hundred or so attributes, it is extremely difficult fo...
Arash Termehchy, Marianne Winslett, Yodsawalai Cho...