English
Related papers

Related papers: On Geometric Upper Bounds for Positioning Algorith…

200 papers

The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…

Optimization and Control · Mathematics 2015-09-15 G. Li , B. S. Mordukhovich , T. T. A. Nghia , T. S. Pham

Although monitoring and covering are fundamental goals of a wireless sensor network (WSN), the accidental death of sensors or the running out of their energy would result in holes in the WSN. Such holes have the potential to disrupt the…

Computational Geometry · Computer Science 2021-06-22 Mansoor Davoodi , Esmaeil Delfaraz , Sajjad Ghobadi , Mahtab Masoori

Hyperbolic spaces have been quite popular in the recent past for representing hierarchically organized data. Further, several classification algorithms for data in these spaces have been proposed in the literature. These algorithms mainly…

Machine Learning · Statistics 2023-09-29 Xiran Fan , Chun-Hao Yang , Baba C. Vemuri

In this paper, we derive an asymptotic closed--form expression for the error bound on extrapolation of doubly selective mobile MIMO wireless channels. The bound shows the relationship between the prediction error and system design…

Information Theory · Computer Science 2014-07-25 Ramoni Adeogun , Paul Teal , Pawel Dmochowski

The movable antenna (MA) is a promising technology to exploit more spatial degrees of freedom for enhancing wireless system performance. However, the MA-aided system introduces the non-convex antenna distance constraints, which poses…

Signal Processing · Electrical Eng. & Systems 2024-07-12 Yichen Jin , Qingfeng Lin , Yang Li , Yik-Chung Wu

This work considers the identification of the available whitespace, i.e., the regions that are not covered by any of the existing transmitters, within a given geographical area. To this end, $n$ sensors are deployed at random locations…

Information Theory · Computer Science 2012-11-21 Rahul Vaze , Chandra R. Murthy

We introduce a new numerical method based on machine learning to approximate the solution of elliptic partial differential equations with collocation using a set of sigmoidal functions. We show that a feedforward neural network with a…

Numerical Analysis · Mathematics 2023-03-24 Francesco Calabrò , Gianluca Fabiani , Constantinos Siettos

Machine learning models have traditionally been developed under the assumption that the training and test distributions match exactly. However, recent success in few-shot learning and related problems are encouraging signs that these models…

Machine Learning · Statistics 2020-10-15 James Lucas , Mengye Ren , Irene Kameni , Toniann Pitassi , Richard Zemel

Sensor networks play a critical role in many situational awareness applications. In this paper, we study the problem of determining sensor placements to balance coverage and connectivity objectives over a target region. Leveraging algebraic…

Optimization and Control · Mathematics 2025-04-08 Mathias Bock Agerman , Ziqiao Zhang , Jong Gwang Kim , Shreyas Sundaram , Christopher Brinton

Underwater acoustic environment estimation is a challenging but important task for remote sensing scenarios. Current estimation methods require high signal strength and a solution to the fragile echo labeling problem to be effective. In…

We consider optimal control problems for partial differential equations where the controls take binary values but vary over the time horizon, they can thus be seen as dynamic switches. The switching patterns may be subject to combinatorial…

Optimization and Control · Mathematics 2024-04-04 Christoph Buchheim , Alexandra Grütering , Christian Meyer

Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…

Information Theory · Computer Science 2011-07-22 Arun Padakandla , Rajesh Sundaresan

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

Computational Geometry · Computer Science 2014-09-16 Danny Rorabaugh

In the recent years, there has been a huge advancement in wireless sensor computing technology. Today, wireless sensor network (WSN) has become a key technology for different types of smart environment. Nodes localization in WSN has arisen…

Networking and Internet Architecture · Computer Science 2016-06-24 Biljana Risteska Stojkoska

Learning classifiers that are robust to adversarial examples has received a great deal of recent attention. A major drawback of the standard robust learning framework is there is an artificial robustness radius $r$ that applies to all…

Machine Learning · Computer Science 2023-01-19 Robi Bhattacharjee , Kamalika Chaudhuri

Locating a target is key in many applications, namely in high-stakes real-world scenarios, like detecting humans or obstacles in vehicular networks. In scenarios where precise statistics of the measurement noise are unavailable,…

Optimization and Control · Mathematics 2022-08-17 João Domingos , Cláudia Soares , João Xavier

Nodes localization in Wireless Sensor Networks (WSN) has arisen as a very challenging problem in the research community. Most of the applications for WSN are not useful without a priori known nodes positions. One solution to the problem is…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-06-27 Biljana Stojkoska , Danco Davcev , Andrea Kulakov

The paper provides global optimization algorithms for two particularly difficult nonconvex problems raised by hybrid system identification: switching linear regression and bounded-error estimation. While most works focus on local…

Machine Learning · Computer Science 2017-11-27 Fabien Lauer

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

The high time resolution of ultra-wideband (UWB) signals facilitates very precise position estimation in many scenarios, which makes a variety applications possible. This paper reviews the problem of position estimation in UWB systems,…

Information Theory · Computer Science 2008-07-18 S. Gezici , H. V. Poor
‹ Prev 1 8 9 10 Next ›