Sciweavers

2430 search results - page 353 / 486
» Computing Tutte Polynomials
Sort
View
135
Voted
EWSN
2004
Springer
16 years 3 months ago
Max-Min Length-Energy-Constrained Routing in Wireless Sensor Networks
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishab...
Rajgopal Kannan, Lydia Ray, Ramaraju Kalidindi, S....
DCC
2008
IEEE
16 years 3 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
135
Voted
ICS
2010
Tsinghua U.
16 years 26 days ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
PPOPP
2010
ACM
16 years 23 days ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
ICWS
2009
IEEE
16 years 20 days ago
What are the Problem Makers: Ranking Activities According to their Relevance for Process Changes
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
Chen Li, Manfred Reichert, Andreas Wombacher