Sciweavers

3818 search results - page 546 / 764
» Word Problems on Compressed Words
Sort
View
COMPGEOM
1997
ACM
15 years 10 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...
ICPP
1996
IEEE
15 years 10 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
ICRE
1996
IEEE
15 years 10 months ago
Structuring utterance records of requirements elicitation meetings based on speech act theory
This paper discusses a technique to structure utterance records of the meetings for requirements elicitation based on speech act theory. To elicit requirements to the system to be...
Motoshi Saeki, Kinji Matsumura, Jun'ichi Shimoda, ...
STOC
1996
ACM
92views Algorithms» more  STOC 1996»
15 years 10 months ago
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
STACS
1997
Springer
15 years 10 months ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal