Sciweavers

4622 search results - page 33 / 925
» Foundations of Information Theory
Sort
View
GD
2004
Springer
15 years 3 months ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
CHI
2008
ACM
15 years 10 months ago
Internalization, qualitative methods, and evaluation
Information Visualization (InfoVis) is at least in part defined by a process that occurs within the subjective internal experience of the users of visualization tools. Hence, user...
Sarah Faisal, Brock Craft, Paul A. Cairns, Ann Bla...
KDD
2006
ACM
118views Data Mining» more  KDD 2006»
15 years 10 months ago
Mining for proposal reviewers: lessons learned at the national science foundation
In this paper, we discuss a prototype application deployed at the U.S. National Science Foundation for assisting program directors in identifying reviewers for proposals. The appl...
Seth Hettich, Michael J. Pazzani
EKAW
2004
Springer
15 years 3 months ago
On the Foundations of UML as an Ontology Representation Language
There is a growing interest in the use of UML class diagrams as a modeling language to represent domain ontologies. In a series of papers (e.g., [1,2]) we have been using the Gener...
Giancarlo Guizzardi, Gerd Wagner, Heinrich Herre
CIKM
1999
Springer
15 years 2 months ago
Binary String Relations: A Foundation for Spatiotemporal Knowledge Representation
The paper is concerned with the qualitative representation of spatiotemporal relations. We initially propose a multiresolution framework for the representation of relations among ...
Vasilis Delis, Thanasis Hadzilacos