Sciweavers

269 search results - page 34 / 54
» On Tree Pattern Query Rewriting Using Views
Sort
View
CVPR
2007
IEEE
16 years 3 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 2 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
SQJ
2010
152views more  SQJ 2010»
15 years 7 days ago
Design pattern evolutions in QVT
One of the main goals of design patterns is to design for change. Many design patterns leave some room for future changes and evolutions. The application of design patterns leads ...
Jing Dong, Yajing Zhao, Yongtao Sun
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
15 years 8 months ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...
STACS
2007
Springer
15 years 8 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom