Sciweavers

1284 search results - page 132 / 257
» Data Structures for Mergeable Trees
Sort
View
COGSCI
2004
148views more  COGSCI 2004»
15 years 2 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
134
Voted
ICIP
2001
IEEE
16 years 3 months ago
Feature coincidence trees for registration of ultrasound breast images
Registration of an image, the query or reference, to a database of rotated and translated exemplars constitutes an important image retrieval and indexing application which arises i...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 5 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
PR
2008
206views more  PR 2008»
15 years 2 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
RT
1999
Springer
15 years 6 months ago
Interactive Ray-Traced Scene Editing using Ray Segment Trees
This paper presents a ray tracer that facilitates near-interactive scene editing with incremental rendering; the user can edit the scene both by manipulating objects and by changin...
Kavita Bala, Julie Dorsey, Seth J. Teller