Sciweavers

4541 search results - page 560 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICML
2004
IEEE
16 years 8 months ago
Large margin hierarchical classification
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
Ofer Dekel, Joseph Keshet, Yoram Singer
EDBT
2008
ACM
120views Database» more  EDBT 2008»
16 years 7 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...
ISAAC
2007
Springer
70views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Kinetic Maintenance of Mobile k-Centres on Trees
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
Stephane Durocher, Christophe Paul
VMCAI
2007
Springer
16 years 1 months ago
DIVINE: DIscovering Variables IN Executables
Abstract. This paper addresses the problem of recovering variable-like entities when analyzing executables in the absence of debugging information. We show that variable-like entit...
Gogul Balakrishnan, Thomas W. Reps
PVLDB
2010
110views more  PVLDB 2010»
15 years 5 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...