Sciweavers

8132 search results - page 203 / 1627
» Dependability, Abstraction, and Programming
Sort
View
RANDOM
1998
Springer
15 years 10 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
VTC
2010
IEEE
195views Communications» more  VTC 2010»
15 years 4 months ago
Efficiency of Distributed Compression and Its Dependence on Sensor Node Deployments
Abstract--In this paper we analyze the energy-efficiency of distributed compression and its dependence on the node deployment strategies for Wireless Sensor Networks (WSNs). Reduce...
Frank Oldewurtel, Janne Riihijärvi, Petri M&a...
VL
2002
IEEE
111views Visual Languages» more  VL 2002»
15 years 11 months ago
An Interrogative Approach to Novice Programming
Domain specific programming languages tend to be rigid in capability and dependent on either a graphical interface or a scripting language. We present a question-oriented approach...
Alexander Quinn
ECCV
2008
Springer
16 years 8 months ago
Scale-Dependent/Invariant Local 3D Shape Descriptors for Fully Automatic Registration of Multiple Sets of Range Images
Abstract. Despite the ubiquitous use of range images in various computer vision applications, little has been investigated about the size variation of the local geometric structure...
John Novatnack, Ko Nishino
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
16 years 6 months ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...