102291 search results - page 145 / 20459 » Computing |
140
click to vote
ISCAS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
180
Voted
PDCAT
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents a novel service discovery framework for ubiquitous computing called Ubiquitous Computing Service Discovery Framework (UCSDF). UCSDF offers a more flexible and ...
196
click to vote
SMI
2006
IEEE
16 years 1 months ago
2006
IEEE
Symbolic computation of NURBS plays an important role in many areas of NURBS-based geometric computation and design. However, any nontrivial symbolic computation, especially when ...
167
click to vote
IPPS
2005
IEEE
16 years 25 days ago
2005
IEEE
We study the energy efficiency benefits of bypassing trivial computations in high-performance processors. Trivial computations are those computations whose output can be determine...
210
click to vote
CIE
2005
Springer
16 years 24 days ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...