Sciweavers

943 search results - page 83 / 189
» How should data structures and algorithms be taught
Sort
View
CIKM
2005
Springer
15 years 8 months ago
Optimizing cursor movement in holistic twig joins
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
Marcus Fontoura, Vanja Josifovski, Eugene J. Sheki...
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 4 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
16 years 4 months ago
Index-Based Approximate XML Joins
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Ting...
ICCAD
2001
IEEE
201views Hardware» more  ICCAD 2001»
15 years 12 months ago
An Integrated Data Path Optimization for Low Power Based on Network Flow Method
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
Chun-Gi Lyuh, Taewhan Kim, Chien-Liang Liu
CSDA
2006
83views more  CSDA 2006»
15 years 3 months ago
Linear grouping using orthogonal regression
A new method to detect different linear structures in a data set, called Linear Grouping Algorithm (LGA), is proposed. LGA is useful for investigating potential linear patterns in...
Stefan Van Aelst, Xiaogang Wang, Ruben H. Zamar, R...