12107 search results - page 2013 / 2422 » Software That Can Think |
147
click to vote
UIST
2006
ACM
16 years 22 days ago
2006
ACM
Current paper-based interfaces such as PapierCraft, provide very little feedback and this limits the scope of possible interactions. So far, there has been little systematic explo...
157
click to vote
UIST
2006
ACM
16 years 22 days ago
2006
ACM
Despite the ubiquity of slide presentations, managing multiple presentations remains a challenge. Understanding how multiple versions of a presentation are related to one another,...
171
click to vote
UIST
2006
ACM
16 years 22 days ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
178
click to vote
WIDM
2006
ACM
16 years 22 days ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
164
click to vote
WWW
2006
ACM
16 years 22 days ago
2006
ACM
We consider the problem of dust: Different URLs with Similar Text. Such duplicate URLs are prevalent in web sites, as web server software often uses aliases and redirections, and...