219 search results - page 41 / 44 » Is the World Linear |
STOC
2010
ACM
13 years 11 months ago
2010
ACM
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...
KDD
1994
ACM
13 years 11 months ago
1994
ACM
We applied TETRAD II, a causal discovery program developed in Carnegie Mellon University's Department of Philosophy, to a database containing information on 204 U.S. colleges...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
CIVR
2008
Springer
13 years 8 months ago
2008
Springer
We describe a novel approach to identifying specific settings in large collections of passively captured images corresponding to a visual diary. An algorithm developed for setting...
CSCLP
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...