Sciweavers

1922 search results - page 28 / 385
» ie 2007
Sort
View
ADHOC
2007
107views more  ADHOC 2007»
13 years 8 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu
APAL
2007
71views more  APAL 2007»
13 years 8 months ago
A lower bound for intuitionistic logic
We give an exponential lower bound on number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL...
Pavel Hrubes
AAI
2006
71views more  AAI 2006»
13 years 8 months ago
Textual Article Clustering in Newspaper Pages
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
Marco Aiello, Andrea Pegoretti
ADCM
2006
61views more  ADCM 2006»
13 years 8 months ago
Inequalities on time-concentrated or frequency-concentrated functions
We obtain an inequality on a measure of the spread in time of periodic functions that are concentrated in frequency, i.e. all but a fixed finite number of Fourier coefficients van...
Say Song Goh, Tim N. T. Goodman
AML
2006
83views more  AML 2006»
13 years 8 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn