Sciweavers

915 search results - page 33 / 183
» Maximally Abstract Retrenchments
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar
CISS
2008
IEEE
14 years 2 months ago
Frames for linear reconstruction without phase
Abstract— The objective of this paper is the linear reconstruction of a vector, up to a unimodular constant, when all phase information is lost, meaning only the magnitudes of fr...
Bernhard G. Bodmann, Peter G. Casazza, Dan Edidin,...
ECML
2006
Springer
13 years 11 months ago
Learning Process Models with Missing Data
Abstract. In this paper, we review the task of inductive process modeling, which uses domain knowledge to compose explanatory models of continuous dynamic systems. Next we discuss ...
Will Bridewell, Pat Langley, Steve Racunas, Stuart...
FIMI
2004
161views Data Mining» more  FIMI 2004»
13 years 9 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...
IEICET
2006
77views more  IEICET 2006»
13 years 8 months ago
Efficient Scheduling for SDMG CIOQ Switches
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
Mei Yang, Si-Qing Zheng