Sciweavers

725 search results - page 141 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
WWW
2003
ACM
15 years 10 months ago
On the bursty evolution of blogspace
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...
MLG
2007
Springer
15 years 3 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
94
Voted
ANCS
2005
ACM
15 years 3 months ago
SSA: a power and memory efficient scheme to multi-match packet classification
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
Fang Yu, T. V. Lakshman, Martin Austin Motoyama, R...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 2 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
88
Voted
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 1 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...