Sciweavers

4536 search results - page 298 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
PDP
2011
IEEE
14 years 10 months ago
Transport Optimization in Peer-to-Peer Networks
Abstract—The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feas...
Konstantin Miller, Adam Wolisz
JCST
2010
109views more  JCST 2010»
15 years 1 months ago
The Inverse Classification Problem
In this paper, we examine an emerging variation of the classification problem, which is known as the inverse classification problem. In this problem, we determine the features to b...
Charu C. Aggarwal, Chen Chen, Jiawei Han
CIKM
2010
Springer
15 years 5 months ago
Visual cube and on-line analytical processing of images
On-Line Analytical Processing (OLAP) has shown great success in many industry applications, including sales, marketing, management, financial data analysis, etc. In this paper, w...
Xin Jin, Jiawei Han, Liangliang Cao, Jiebo Luo, Bo...
CORR
2012
Springer
176views Education» more  CORR 2012»
14 years 2 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
177
Voted
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 11 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig