Sciweavers

6274 search results - page 297 / 1255
» From query complexity to computational complexity
Sort
View
HCI
2007
15 years 7 months ago
Reminders, Alerts and Pop-ups: The Cost of Computer-Initiated Interruptions
Responding to computer-initiated notifications requires a shift in attention that disrupts the flow of work. The degree of cost associated with resuming the original task following...
Helen M. Hodgetts, Dylan M. Jones
CANDC
2002
ACM
15 years 6 months ago
Computer aided creativity: practical experience and theoretical concerns
In this paper I will outline some of the practical experiences and theoretical concerns that have informed some 15 years of research into the relationship between human creativity...
Robert Pepperell
174
Voted
ICCSA
2007
Springer
16 years 9 days ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
AI
2010
Springer
15 years 6 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
ICIP
2003
IEEE
16 years 7 months ago
New image retrieval paradigm: logical composition of region categories
We present a novel framework for intelligent search and retrieval by image content composition. Very different from the existing Query-by-Example paradigm, logical queries are exp...
Julien Fauqueur, Nozha Boujemaa