Sciweavers

7840 search results - page 1427 / 1568
» On generalized Ramsey numbers
Sort
View
ALT
2000
Springer
14 years 19 days ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
COMPUTE
2010
ACM
14 years 18 days ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 18 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
WWW
2010
ACM
14 years 18 days ago
Access: news and blog analysis for the social sciences
The social sciences strive to understand the political, social, and cultural world around us, but have been impaired by limited access to the quantitative data sources enjoyed by ...
Mikhail Bautin, Charles B. Ward, Akshay Patil, Ste...
ICML
1999
IEEE
14 years 18 days ago
Learning Hierarchical Performance Knowledge by Observation
Developing automated agents that intelligently perform complex real world tasks is time consuming and expensive. The most expensive part of developing these intelligent task perfo...
Michael van Lent, John E. Laird
« Prev « First page 1427 / 1568 Last » Next »