4411 search results - page 535 / 883 » Communication Complexity and Its Applications |
167
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
171
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
155
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
177
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
Networks of small devices, such as environmental sensors, introduce a number of new challenges for traditional protocols and approaches. In particular, the extreme resource constr...
154
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
The traditional SPM approach based on bag-of-features (BoF) must use nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effec...