Sciweavers

925 search results - page 153 / 185
» Connectivity on Complete Lattices
Sort
View
WMASH
2004
ACM
14 years 24 days ago
Smart edge server: beyond a wireless access point
Wireless access at cafes, airports, homes and businesses have proliferated all over the globe with several different Wireless Internet Service Providers. Similarly, digital media ...
Geetha Manjunath, Tajana Simunic, Venkatesh Krishn...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 22 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
14 years 18 days ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
VISUALIZATION
1999
IEEE
13 years 11 months ago
Tetrahedral Mesh Compression with the Cut-Border Machine
In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine t...
Stefan Gumhold, Stefan Guthe, Wolfgang Straß...
MOBICOM
1996
ACM
13 years 11 months ago
Building Reliable Mobile-Aware Applications Using the Rover Toolkit
This paper discusses extensions to the Rover toolkit for constructing reliable mobile-aware applications. The extensions improve upon the existing failure model, which only addres...
Anthony D. Joseph, M. Frans Kaashoek