Author image not provided
 Randy George Goebel

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.20
Citation Count256
Publication count80
Publication years1985-2017
Available for download12
Average downloads per article217.83
Downloads (cumulative)2,614
Downloads (12 Months)176
Downloads (6 Weeks)26
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


80 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 80
Result page: 1 2 3 4 5

Sort by:

1 published by ACM
June 2017 ICAIL '17: Proceedings of the 16th edition of the International Conference on Articial Intelligence and Law
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 9,   Downloads (12 Months): 9,   Downloads (Overall): 9

Full text available: PDFPDF
Our legal question answering system combines legal information retrieval and textual entailment, and exploits semantic information using a logic-based representation. We have evaluated our system using the data from the competition on legal information extraction/entailment (COLIEE)-2017. The competition focuses on the legal information processing required to answer yes/no questions from ...
Keywords: legal text mining, logic representation, question answering, textual entailment

2
January 2016 Theoretical Computer Science: Volume 609 Issue P3, January 2016
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

Tries and patricia tries are two popular data structures for storing strings. Let Hn denote the height of the trie (the patricia trie, respectively) on a set of n strings. Under the uniform distribution model on the strings, it is well known that Hn/logn2 for tries and Hn/logn1 for patricia ...
Keywords: Smoothed analysis, Trie, Data structure, Patricia trie

3
October 2015 Journal of Combinatorial Optimization: Volume 30 Issue 3, October 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The Bandpass-2 problem is a variant of the maximum traveling salesman problem arising from optical communication networks using wavelength-division multiplexing technology, in which the edge weights are dynamic rather than fixed. The previously best approximation algorithm for this NP-hard problem has a worst-case performance ratio of $$\frac{227}{426}.$$227426. Here we present ...
Keywords: Acyclic 2-matching, Maximum weight $$b$$b-matching, Worst case performance ratio, Approximation algorithm, The Bandpass problem

4 published by ACM
July 2015 ACM Transactions on Intelligent Systems and Technology (TIST) - Regular Papers and Special Section on Intelligent Healthcare Informatics: Volume 6 Issue 4, August 2015
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 70,   Downloads (Overall): 194

Full text available: PDFPDF
We explore methods for effectively extracting information from clinical narratives that are captured in a public health consulting phone service called HealthLink. Our research investigates the application of state-of-the-art natural language processing and machine learning to clinical narratives to extract information of interest. The currently available data consist of dialogues ...
Keywords: named entity recognition, biomedical text mining, Tele-health mining, effective information retrieval

5
October 2014 Theoretical Computer Science: Volume 556 Issue C, October 2014
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

RNA interactions are fundamental in many cellular processes, where two or more RNA molecules can be involved. Multiple RNA interactions are also believed to be much more complex than pairwise interactions. Recently, multiple RNA interaction prediction has been formulated as a maximization problem. Here we extensively examine this optimization problem ...
Keywords: Approximation algorithm, Maximum weight b-matching, RNA interaction, Acyclic 2-matching, Worst case performance ratio

6
October 2014 Theoretical Computer Science: Volume 554 Issue C, October 2014
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

We investigate the minimum independent dominating set in perturbed graphs g ( G , p ) of input graph G = ( V , E ) , obtained by negating the existence of edges independently with a probability p 0 . The minimum independent dominating set (MIDS) problem does not ...
Keywords: Approximation algorithm, Dominating set, Independent dominating set, Independent set, Perturbed graph, Smooth analysis

7
September 2014 Theoretical Computer Science: Volume 550, September, 2014
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 1

In this paper, we apply a measure, exemplar adjacency number, which complements and extends the well-studied breakpoint distance between two permutations, to measure the similarity between two genomes (or in general, between any two sequences drawn from the same alphabet). For two genomes G and H drawn from the same ...
Keywords: Breakpoint, Genome comparison, Approximation algorithm, NP-hard, Adjacency

8
November 2012 JSAI-isAI'12: Proceedings of the 2012 international conference on New Frontiers in Artificial Intelligence
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We describe a method for extractive summarization of legal judgments using our own graph-based summarization algorithm. In contrast to the connected and undirected graphs of previous work, we construct directed and disconnected graphs (a set of connected graphs) for each document, where each connected graph indicates a cluster that shares ...
Keywords: summarization, information extraction, legal case, graph representation

9
July 2012 IV '12: Proceedings of the 2012 16th International Conference on Information Visualisation
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0


10
May 2012 FAW-AAIM'12: Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

The general Bandpass-<em>B</em> problem is NP-hard and can be approximated by a reduction into the <em>B</em> -set packing problem, with a worst case performance ratio of <em>O</em> (<em>B</em> 2 ). When <em>B</em> =2, a maximum weight matching gives a 2-approximation to the problem. The Bandpass-2 problem, or simply the Bandpass ...
Keywords: approximation algorithm, maximum weight matching, bandpass problem, edge coloring, worst case performance ratio

11
May 2012 Journal of Computer and System Sciences: Volume 78 Issue 3, May, 2012
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 2

Given two genomic maps G"1 and G"2 each represented as a sequence of n gene markers, the maximal strip recovery (MSR) problem is to retain the maximum number of markers in both G"1 and G"2 such that the resultant subsequences, denoted as G"1^@? and G"2^@?, can be partitioned into the ...
Keywords: Approximation algorithm, Local amortized analysis, Maximal strip recovery, Re-weighting scheme

12
March 2012 Security and Communication Networks: Volume 5 Issue 3, March 2012
Publisher: John Wiley & Sons, Inc.
Bibliometrics:
Citation Count: 0

We present a robust and adaptive-capacity watermarking algorithm for agglutinative languages. All processes, including the selection of sentences to be watermarked, watermark embedding, and watermark extraction, are based on syntactic dependency trees. We show that it is more robust to use syntactic dependency trees than the surface forms of sentences ...
Keywords: syntactic dependency tree, morphological division, natural language watermarking, agglutinative language

13
July 2011 IV '11: Proceedings of the 2011 15th International Conference on Information Visualisation
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

This paper collates eight expert opinions about Knowledge Visualization, what it is and what it should be. An average of 581 words long, topics span from representation, storytelling and criticizing the lack of theory, to communication, analytics for the masses and reasoning, to trendy Visual Thinking and creativity beyond PowerPoint. ...

14
May 2011 FAW-AAIM'11: Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Given two genomic maps G 1 and G 2 each represented as a sequence of n gene markers, the maximal strip recovery (MSR) problem is to retain the maximum number of markers in both G1 and G2 such that the resultant subsequences, denoted as G 1 * and G 2 ...
Keywords: sequential amortized analysis, approximation algorithm, maximal strip recovery

15
May 2011 LPNMR'11: Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Logic programs with abstract constraint atoms provide a unifying framework for studying logic programs with various kinds of constraints. Establishing strong equivalence between logic programs is a key property for program maintenance and optimization, and for guaranteeing the same behavior for a revised original program in any context. In this ...

16
April 2011 Artificial Intelligence: Volume 175 Issue 5-6, April, 2011
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0


17
January 2011 Theoretical Computer Science: Volume 412 Issue 3, January, 2011
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 7

In the multicast k-tree routing problem, a data copy is sent from the source node to at most k destination nodes in every transmission. The goal is to minimize the total cost of sending data to all destination nodes, which is measured as the sum of the costs of all ...
Keywords: Capacitated multicast tree routing, Tree partitioning, Approximation algorithm

18
December 2010 ICDMW '10: Proceedings of the 2010 IEEE International Conference on Data Mining Workshops
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

Meerkat is a tool for visualization and community mining of social networks. It is being developed to offer novel algorithms and functionality that other tools do not possess. Meerkat’s features include navigation through graphical representations of networks, network querying and filtering, a multitude of graphical layout algorithms, community mining using ...
Keywords: social networks, informational networks, community mining

19 published by ACM
October 2010 AND '10: Proceedings of the fourth workshop on Analytics for noisy unstructured text data
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 24,   Downloads (Overall): 196

Full text available: PDFPDF
'For the past 4-5 years, we've been investigating a variety of computational methods for extracting linguistic structures from relatively large language corpora. These include the use of well-known standard labeled language resources such as those from the Linguistic Data Consortium, as well as a spectrum of unlabeled resources, including the ...
Keywords: natural language processing machine learning

20
August 2010 CLIMA'10: Proceedings of the 11th international conference on Computational logic in multi-agent systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Answer sharing is a key element in multi-agent systems as it allows agents to collaborate towards achieving a global goal. However exogenous knowledge of the world can influence each agent's local computation, and communication channels may introduce delays, creating multiple partial answers at different times. Agent's answers may, therefore, be ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us