Sciweavers

2226 search results - page 182 / 446
» Computable Analysis via Representations
Sort
View
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
16 years 8 months ago
Propagating XML Constraints to Relations
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...
ICPR
2006
IEEE
16 years 25 days ago
Efficient Night Gait Recognition Based on Template Matching
Gait is a useful biometric which can be used to recognize people at a distance when other biometrics are incapable. However, most work on gait recognition has been visible spectru...
Daoliang Tan, Kaiqi Huang, Shiqi Yu, Tieniu Tan
PODC
2010
ACM
15 years 10 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
AB
2008
Springer
15 years 8 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
ICCV
2011
IEEE
14 years 6 months ago
Blurring-Invariant Riemannian Metrics for Comparing Signals and Images
We propose a novel Riemannian framework for comparing signals and images in a manner that is invariant to their levels of blur. This framework uses a log-Fourier representation of...
Zhengwu Zhang, Eric Klassen, Anuj Srivastava, Pava...