Sciweavers

3020 search results - page 517 / 604
» Optimal partition trees
Sort
View
IANDC
2008
122views more  IANDC 2008»
15 years 4 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
COMCOM
2006
283views more  COMCOM 2006»
15 years 4 months ago
Sleep scheduling for wireless sensor networks via network flow model
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost...
Rick W. Ha, Pin-Han Ho, Sherman X. Shen, Junshan Z...
CORR
2006
Springer
147views Education» more  CORR 2006»
15 years 4 months ago
ARQ Diversity in Fading Random Access Channels
A cross-layer optimization approach is adopted for the design of symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical la...
Young-Han Nam, Praveen Kumar Gopala, Hesham El Gam...
JPDC
2006
187views more  JPDC 2006»
15 years 4 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
TIT
2008
112views more  TIT 2008»
15 years 4 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar