8512 search results - page 259 / 1703 » Computing Theory With Relevance |
166
click to vote
CIE
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
158
click to vote
CHI
2003
ACM
16 years 6 months ago
2003
ACM
How is interacting with computer programs different from interacting with people? One answer in the literature is that these two types of interactions are similar. The present stu...
149
click to vote
AUTOMOTIVEUI
2009
ACM
16 years 20 days ago
2009
ACM
Intuitive use is met when prior knowledge is transferred to new task environments. The empirical fact that transfer relies on schemas led us to diagnose intuitiveness based on sch...
134
Voted
IPPS
2007
IEEE
16 years 13 days ago
2007
IEEE
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
178
click to vote
IJON
2008
15 years 6 months ago
2008
In this work we address the problem of boundary detection by combining ideas and approaches from biological and computational vision. Initially, we propose a simple and efficient ...