Sciweavers

1511 search results - page 172 / 303
» On the effectiveness of address-space randomization
Sort
View
HT
1991
ACM
13 years 11 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
CICLING
2010
Springer
13 years 11 months ago
ETL Ensembles for Chunking, NER and SRL
We present a new ensemble method that uses Entropy Guided Transformation Learning (ETL) as the base learner. The proposed approach, ETL Committee, combines the main ideas of Baggin...
Cícero Nogueira dos Santos, Ruy Luiz Milidi...
CVPR
2010
IEEE
13 years 10 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
DEXAW
2005
IEEE
125views Database» more  DEXAW 2005»
13 years 10 months ago
Exploiting Local Popularity to Prune Routing Indices in Peer-to-Peer Systems
Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the...
Stéphane Bressan, Achmad Nizar Hidayanto, Z...
ASUNAM
2010
IEEE
13 years 9 months ago
Semi-Supervised Classification of Network Data Using Very Few Labels
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
Frank Lin, William W. Cohen