Sciweavers

4998 search results - page 717 / 1000
» The case for intentional networking
Sort
View
DAC
2002
ACM
16 years 7 months ago
A framework for evaluating design tradeoffs in packet processing architectures
We present an analytical method to evaluate embedded network packet processor architectures, and to explore their design space. Our approach is in contrast to those based on simul...
Lothar Thiele, Matthias Gries, Samarjit Chakrabort...
ICALP
2009
Springer
16 years 7 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 7 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
SIGMOD
2003
ACM
134views Database» more  SIGMOD 2003»
16 years 6 months ago
Location-based Spatial Queries
In this paper we propose an approach that enables mobile clients to determine the validity of previous queries based on their current locations. In order to make this possible, th...
Jun Zhang, Manli Zhu, Dimitris Papadias, Yufei Tao...
DCC
2007
IEEE
16 years 6 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin