Sciweavers

256 search results - page 41 / 52
» Short trees in polygons
Sort
View
WEBDB
2009
Springer
112views Database» more  WEBDB 2009»
14 years 3 months ago
Querying DAG-shaped Execution Traces Through Views
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
Maya Ben-Ari, Tova Milo, Elad Verbin
CIKM
2007
Springer
14 years 2 months ago
Structure and semantics for expressive text kernels
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
Stephan Bloehdorn, Alessandro Moschitti
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
14 years 2 months ago
Application-aware Overlay Networks for Data Dissemination
XPORT (eXtensible Profile-driven Overlay Routing Trees) is a generic data dissemination system that supports an extensible set of data types and profiles, and an optimization fr...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...
ISCAS
2005
IEEE
104views Hardware» more  ISCAS 2005»
14 years 2 months ago
On the three-dimensional channel routing
— The 3-D channel routing is a fundamental problem on the physical design of 3-D integrated circuits. The 3-D channel is a 3-D grid G and the terminals are vertices of G located ...
Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, S...
WIDM
2004
ACM
14 years 2 months ago
Measuring similarity between collection of values
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
Carina F. Dorneles, Carlos A. Heuser, Andrei E. N....