Sciweavers

126 search results - page 18 / 26
» Spatio-Temporal Access Methods: Part 2 (2003 - 2010)
Sort
View
122
Voted
PERCOM
2003
ACM
15 years 5 months ago
Application-Service Interoperation without Standardized Service Interfaces
To programmatically discover and interact with services in ubiquitous computing environments, an application needs to solve two problems: (1) is it semantically meaningful to inte...
Shankar Ponnekanti, Armando Fox
117
Voted
CASES
2005
ACM
15 years 2 months ago
Exploiting pipelining to relax register-file port constraints of instruction-set extensions
Customisable embedded processors are becoming available on the market, thus making it possible for designers to speed up execution of applications by using Application-specific F...
Laura Pozzi, Paolo Ienne
103
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
INFOCOM
2003
IEEE
15 years 5 months ago
Performance anomaly of 802.11b
— We analyze the performance of the IEEE 802.11b wireless local area networks. We have observed that when some mobile hosts use a lower bit rate than the others, the performance ...
Gilles Berger-Sabbatel, Franck Rousseau, Martin He...
118
Voted
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 1 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand