Sciweavers

3176 search results - page 428 / 636
» A Multi-Resolution Relational Data Model
Sort
View
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 10 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
ASIACRYPT
2009
Springer
14 years 4 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
ESANN
2006
13 years 11 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
LFCS
2007
Springer
14 years 4 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
DEXA
2003
Springer
130views Database» more  DEXA 2003»
14 years 3 months ago
Finding Neighbor Communities in the Web Using Inter-site Graph
In recent years, link-based information retrieval methods from the Web are developed. A framework of these methods is a Web graph using pages as vertices and Web-links as edges. In...
Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masa...