4037 search results - page 58 / 808 » Routing without ordering |
120
Voted
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
A fundamental task in artificial intelligence and computer vision is to build machines that can behave like a human in recognizing a broad range of visual concepts. This paper aims...
158
Voted
TYPES
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
121
click to vote
CSCW
2008
ACM
15 years 4 months ago
2008
ACM
When involved in collaborative tasks, users often choose to use multi-synchronous applications in order to concurrently work in isolation. Hence, privacy of their changes is maint...
126
click to vote
SIROCCO
2008
15 years 3 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
110
click to vote
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...