38 search results - page 3 / 8 » Open Problems from CCCG 2002 |
CORR
2002
Springer
13 years 5 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
KDD
2002
ACM
14 years 5 months ago
2002
ACM
Automated detection of the first document reporting each new event in temporally-sequenced streams of documents is an open challenge. In this paper we propose a new approach which...
SIGMOD
2002
ACM
14 years 5 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
DSS
2002
13 years 5 months ago
2002
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
CHI
2002
ACM
14 years 5 months ago
2002
ACM
This paper borrows ideas from social science to inform the design of novel "sensing" user-interfaces for computing technology. Specifically, we present five design chall...