David Shallcross

According to our database, David Shallcross authored at least 27 papers between 1989 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Can Large Language Models Detect Misinformation in Scientific News Reporting?

Yupeng Cao, Aishwarya Muralidharan Nair, Elyon Eyimife, Nastaran Jamalipour Soofi, K. P. Subbalakshmi, John R. Wullert II, Chumki Basu, David Shallcross

CoRR, 2024

2015

Discovering Functional Communities in Social Media.

Brian Thompson, Linda Ness, David Shallcross, Devasis Bassu

Proceedings of the IEEE International Conference on Data Mining Workshop, 2015

Application of multi-scale singular vector decomposition to vessel classification in overhead satellite imagery.

Rauf Izmailov, Devasis Bassu, Allen McIntosh, Linda Ness, David Shallcross

Proceedings of the Seventh International Conference on Digital Image Processing, 2015

2014

On Minimizing the Size of Encrypted Databases.

Giovanni Di Crescenzo, David Shallcross

Proceedings of the Data and Applications Security and Privacy XXVIII, 2014

2013

Automated design algorithms for tactical wireless networks.

Ossama Younis, Latha A. Kant, Kenneth Young, David Shallcross, Kyriakos Manousakis, Kaustubh Sinkar, Miriam Tauil, Sunil Samtani, Charles Graff, Mitesh P. Patel

Ad Hoc Networks, 2013

2012

Network restoration under dual failures using path-protecting preconfigured cycles.

Martin I. Eiger, Hanan Luss, David Shallcross

Telecommun. Syst., 2012

TDMA scheduling and channel assignment for cognitive tactical networks.

Ossama Younis, David Shallcross, Latha A. Kant, Kenneth Young, Charles Graff, Mitesh P. Patel

Proceedings of the 31st IEEE Military Communications Conference, 2012

Centralized multi-scale singular value decomposition for feature construction in LIDAR image classification problems.

Devasis Bassu, Rauf Izmailov, Allen McIntosh, Linda Ness, David Shallcross

Proceedings of the 2012 IEEE Applied Imagery Pattern Recognition Workshop, 2012

2011

Network restoration under a single link or node failure using Preconfigured Virtual Cycles.

Martin I. Eiger, Hanan Luss, David Shallcross

Telecommun. Syst., 2011

Spectrum allocation in C-NEDAT: A tool to automate MANET design and opportunistically adapt network spectrum use.

Miriam Tauil, David Shallcross, Latha A. Kant, Charles Graff, Mitesh P. Patel

Proceedings of the MILCOM 2011, 2011

2010

Cognitive tactical network models.

Ossama Younis, Latha A. Kant, Anthony J. McAuley, Kyriakos Manousakis, David Shallcross, Kaustubh Sinkar, Kirk Chang, Kenneth Young, Charles Graff, Mitesh P. Patel

IEEE Commun. Mag., 2010

Joint optimization of scheduling and multicast trees by column-generation.

K. R. Krishnan, David Shallcross, Latha A. Kant

Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2010), May 31, 2010

2008

Network science based approaches to design and analyze MANETs for military applications.

Latha A. Kant, Kenneth Young, Ossama Younis, David Shallcross, Kaustubh Sinkar, Anthony J. McAuley, Kyriakos Manousakis, Kirk Chang, Charles Graff

IEEE Commun. Mag., 2008

Simulating and implementing geospatially-based binding mechanisms for mobile peering.

Ben Falchuk, David Shallcross

Proceedings of the 1st International ICST Conference on Ambient Media and Systems, 2008

2006

Impact of services on network capacity: tool for seamless integration of service and network modeling.

Shoshana Loeb, Benjamin Falchuk, Mark W. Garrett, Abdelhakim Hafid, K. Kim, K. R. Krishnan, David Shallcross

Proceedings of the 3rd IEEE Consumer Communications and Networking Conference, 2006

2001

Distance Realization Problems with Applications to Internet Tomography.

Fan R. K. Chung, Mark W. Garrett, Ronald L. Graham, David Shallcross

J. Comput. Syst. Sci., 2001

Node Placement and Sizing for Copper Broadband Access Networks.

Tamra Carpenter, Martin I. Eiger, David Shallcross, Paul D. Seymour

Ann. Oper. Res., 2001

1998

Planar Integer Linear Programming is NC Equivalent to Euclidean GCD.

David Shallcross, Victor Y. Pan, Yu Lin-Kriz

SIAM J. Comput., 1998

The topological structure of maximal lattice free convex bodies: The general case.

Imre Bárány, Herbert E. Scarf, David Shallcross

Math. Program., 1998

1996

A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer.

Milena Mihail, David Shallcross, Nate Dean, Marco Mostrel

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1993

Shortest Integer Vectors.

Herbert E. Scarf, David F. Shallcross

Math. Oper. Res., 1993

The Frobenius Problem and Maximal Lattice Free Bodies.

Herbert E. Scarf, David F. Shallcross

Math. Oper. Res., 1993

An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming.

William J. Cook, Thomas Rutherford, Herbert E. Scarf, David Shallcross

INFORMS J. Comput., 1993

The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD

David Shallcross, Victor Y. Pan, Yu Lin-Kriz

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

A polynomial algorithm for a one machine batching problem.

David F. Shallcross

Oper. Res. Lett., 1992

Neighbors of the Origin for Four by Three Matrices.

David Shallcross

Math. Oper. Res., 1992

1989

Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints.

Clyde L. Monma, David F. Shallcross

Oper. Res., 1989