Sciweavers

463 search results - page 89 / 93
» A General Framework for Graph Sparsification
Sort
View
ICDE
2010
IEEE
258views Database» more  ICDE 2010»
14 years 2 months ago
Anonymized Data: Generation, models, usage
Data anonymization techniques have been the subject of intense investigation in recent years, for many kinds of structured data, including tabular, item set and graph data. They e...
Graham Cormode, Divesh Srivastava
ICCV
2005
IEEE
14 years 1 months ago
Surface Parameterization Using Riemann Surface Structure
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
Yalin Wang, Xianfeng Gu, Kiralee M. Hayashi, Tony ...
KCAP
2003
ACM
14 years 27 days ago
Towards topic-based summarization for interactive document viewing
Our research aims at interactive document viewers that can select and highlight relevant text passages on demand. Another related objective is the generation of topic-specific su...
Achim G. Hoffmann, Son Bao Pham
ATAL
2010
Springer
13 years 8 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
AI
2007
Springer
13 years 7 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne