Sciweavers

1242 search results - page 236 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
VIS
2007
IEEE
80views Visualization» more  VIS 2007»
14 years 8 months ago
Topologically Clean Distance Fields
Analysis of materials obtained from physical simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated...
Attila G. Gyulassy, Mark A. Duchaineau, Vijay Na...
WWW
2008
ACM
14 years 8 months ago
Facetnet: a framework for analyzing communities and their evolutions in dynamic networks
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...
Yu-Ru Lin, Yun Chi, Shenghuo Zhu, Hari Sundaram, B...
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 7 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 7 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau