Sciweavers

4850 search results - page 146 / 970
» Approximate Data Structures with Applications
Sort
View
GI
2008
Springer
15 years 1 months ago
A Novel Conceptual Model for Accessing Distributed Data and Applications, as well as Devices
: As data and services are increasingly distributed in the network, rather than stored in a fixed location, one can imagine a scenario in which the Personal Computer, intended as a...
Lucia Terrenghi, Thomas Lang
113
Voted
ICISS
2010
Springer
14 years 10 months ago
ValueGuard: Protection of Native Applications against Data-Only Buffer Overflows
Abstract. Code injection attacks that target the control-data of an application have been prevalent amongst exploit writers for over 20 years. Today however, these attacks are gett...
Steven Van Acker, Nick Nikiforakis, Pieter Philipp...
140
Voted
CVPR
2004
IEEE
16 years 2 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
UAI
1998
15 years 2 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
116
Voted
VLDB
2004
ACM
120views Database» more  VLDB 2004»
15 years 6 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...