Sciweavers

736 search results - page 96 / 148
» A dynamic data structure for approximate range searching
Sort
View
ADC
2008
Springer
114views Database» more  ADC 2008»
13 years 10 months ago
An Integrated Access Control for Securely Querying and Updating XML Data
Many existing access controls use node filtering or querying rewriting techniques. These techniques require rather time-consuming processes such as parsing, labeling, pruning and/...
Maggie Duong, Yanchun Zhang
AIRWEB
2008
Springer
13 years 10 months ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
HPCC
2005
Springer
14 years 2 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
GIS
2007
ACM
14 years 9 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
25
Voted
FMCAD
2009
Springer
14 years 3 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...