318 search results - page 57 / 64 » Real Number Computability and Domain Theory |
209
Voted
POPL
2006
ACM
16 years 22 days ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
FCT
2009
Springer
15 years 7 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
117
Voted
CVPR
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we develop a theory for characterizing how deformable a shape is. We define a term called “deformability index” for shapes. The deformability index is computed ...
107
Voted
IWANN
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Ubiquitous computing research have extended traditional environments in the so–called Intelligent Environments. All of them use their capabilities for pursuing their in...
91
Voted
IISWC
2006
IEEE
15 years 6 months ago
2006
IEEE
— Understanding the behavior of emerging workloads is important for designing next generation microprocessors. For addressing this issue, computer architects and performance anal...