default search action
Kevin Ross
Person information
- affiliation: University of California, Santa Cruz, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c9]Kevin Ross, Melody Moh, Teng-Sheng Moh
, Jason Yao:
Multi-source data analysis and evaluation of machine learning techniques for SQL injection detection. ACM Southeast Regional Conference 2018: 1:1-1:8 - 2015
- [j8]Kevin Ross, Nicholas Bambos
Cone Schedules for Processing Systems in Fluctuating Environments. IEEE Trans. Autom. Control. 60(10): 2710-2715 (2015) - 2014
- [j7]Aditya Oza, Kevin Ross, Richard M. Low, Mark Stamp
HTTP attack detection using n-gram analysis. Comput. Secur. 45: 242-254 (2014) - [j6]Joseph L. Rios, Kevin Ross:
Converging upon basic feasible solutions through Dantzig-Wolfe decomposition. Optim. Lett. 8(1): 171-180 (2014) - 2012
- [j5]Vijay Mehrotra, Kevin Ross, Geoffrey S. Ryder, Yong-Pin Zhou:
Routing to Manage Resolution and Waiting Time in Call Centers with Heterogeneous Servers. Manuf. Serv. Oper. Manag. 14(1): 66-81 (2012) - 2011
- [i1]Kevin Ross, Nicholas Bambos, George Michailidis:
Cone Schedules for Processing Systems in Fluctuating Environments. CoRR abs/1105.0417 (2011) - 2010
- [j4]Joseph L. Rios, Kevin Ross:
Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling. J. Aerosp. Comput. Inf. Commun. 7(1): 32-45 (2010)
2000 – 2009
- 2009
- [j3]Kevin Ross, Nicholas Bambos:
Projective cone scheduling (PCS) algorithms for packet switches of maximal throughput. IEEE/ACM Trans. Netw. 17(3): 976-989 (2009) - 2007
- [j2]Amarjit Budhiraja, Kevin Ross:
Convergent Numerical Scheme for Singular Stochastic Control with State Constraints in a Portfolio Selection Problem. SIAM J. Control. Optim. 45(6): 2169-2206 (2007) - 2006
- [c8]Kevin Ross, Nicholas Bambos:
Job Scheduling for Maximal Throughput in Autonomic Computing Systems. IWSOS/EuroNGI 2006: 105-119 - [c7]Kevin Ross, Nicholas Bambos:
Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers. GLOBECOM 2006 - 2005
- [c6]Geoffrey S. Ryder, Kevin Ross:
A probability collectives approach to weighted clustering algorithms for ad hoc networks. Communications and Computer Networks 2005: 94-99 - [c5]Kevin Ross, Nicholas Bambos:
Dynamic quality of service control in packet switch scheduling. ICC 2005: 396-401 - [c4]Kevin Ross, Nicholas Bambos:
Packet Scheduling Across Networks of Switches. ICN (1) 2005: 849-856 - 2004
- [c3]Kevin Ross, Nicholas Bambos:
Optimizing quality of service in packet switch scheduling. ICC 2004: 1986-1990 - [c2]Kevin Ross, Nicholas Bambos:
Local Search Scheduling Algorithms for Maximal Throughput in Packet Switches. INFOCOM 2004: 1158-1169 - 2003
- [j1]Kevin Ross, Nicholas Bambos
Scheduling bursts in time-domain wavelength interleaved networks. IEEE J. Sel. Areas Commun. 21(9): 1441-1451 (2003) - [c1]Kevin Ross, Nicholas Bambos, Krishnan Kumaran, Iraj Saniee, Indra Widjaja:
Dynamic scheduling of optical data bursts in time-domain wavelength interleaved networks. Hot Interconnects 2003: 108-113
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: