Sciweavers

736 search results - page 122 / 148
» Approximating the Number of Network Motifs
Sort
View
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
15 years 4 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
INFOSCALE
2009
ACM
15 years 4 months ago
Measuring IP Address Fragmentation from BGP Routing Dynamics
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
Xia Yin, Xin Wu, Zhiliang Wang
IWCMC
2009
ACM
15 years 4 months ago
Quantized transmit beamforming with antenna selection in a MIMO channel
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
Wiroonsak Santipach
FOCI
2007
IEEE
15 years 4 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe
ICRA
2006
IEEE
111views Robotics» more  ICRA 2006»
15 years 3 months ago
Placement and Distributed Deployment of Sensor Teams for Triangulation based Localization
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
Volkan Isler