Sciweavers

379 search results - page 24 / 76
» Strong reducibility of partial numberings
Sort
View
PODS
1999
ACM
160views Database» more  PODS 1999»
13 years 12 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
GLOBECOM
2010
IEEE
13 years 5 months ago
Providing Secrecy Irrespective of Eavesdropper's Channel State
A usual concern against physical layer security is that the legitimate parties would need to have (partial) channel state information (CSI) of the eavesdropper in order to design t...
Xiang He, Aylin Yener
LCPC
2001
Springer
14 years 3 days ago
A Compilation Framework for Power and Energy Management on Mobile Computers
This paper discusses the potential benefits of applicationspecific power management through remote task execution. Power management is crucial for mobile devices that have to re...
Ulrich Kremer, Jamey Hicks, James M. Rehg
KR
2004
Springer
14 years 1 months ago
A Causal Logic of Logic Programming
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...
Alexander Bochman
CGO
2003
IEEE
14 years 29 days ago
Code Optimization for Code Compression
With the emergence of software delivery platforms such as Microsoft’s .NET, reduced size of transmitted binaries has become a very important system parameter strongly affecting ...
Milenko Drinic, Darko Kirovski, Hoi Vo