Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ACL
1998
11 years 11 months ago
Error-Driven Pruning of Treebank Grammars for Base Noun Phrase Identification
Finding simple, non-recursive, base noun phrases is an important subtask for many natural language processing applications. While previous empirical methods for base NP identifica...
Claire Cardie, David R. Pierce
CCCG
2007
11 years 11 months ago
The Ordinary Line Problem Revisited
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
Asish Mukhopadhyay, Eugene Greene
CICLING
2004
Springer
12 years 1 months ago
A Syllabification Algorithm for Spanish
This paper presents an algorithm for dividing Spanish words into syllables. This algorithm is based on grammatical rules which were translated into a simple algorithm, easy to impl...
Heriberto Cuayáhuitl
CGI
2004
IEEE
12 years 1 months ago
An Efficient Central Path Algorithm for Virtual Navigation
We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less preprocessing and...
Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Pr...
SSS
2009
Springer
118views Control Systems» more  SSS 2009»
12 years 2 months ago
Brief Announcement: A Simple and Quiescent Omega Algorithm in the Crash-Recovery Model
We present a simple algorithm that implements the Omega failure detector in the crash-recovery model. The algorithm is quiescent, i.e., eventually all the processes but the leader ...
Cristian Martín, Mikel Larrea
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
12 years 3 months ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
APLAS
2005
ACM
12 years 3 months ago
Register Allocation Via Coloring of Chordal Graphs
We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observa...
Fernando Magno Quintão Pereira, Jens Palsbe...
SCAM
2006
IEEE
12 years 3 months ago
Constructing Accurate Application Call Graphs For Java To Model Library Callbacks
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
Weilei Zhang, Barbara G. Ryder
FOCS
2006
IEEE
12 years 4 months ago
Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm f...
Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
12 years 10 months ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu
books