Sciweavers

1242 search results - page 205 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
PR
2007
189views more  PR 2007»
13 years 7 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
WKDD
2010
CPS
238views Data Mining» more  WKDD 2010»
13 years 5 months ago
3D Scientific Data Mining in Ion Trajectories
In physics, structure of glass and ion trajectories are essentially based on statistical analysis of data acquired through experimental measurement and computer simulation [1, 2]. ...
J. M. Sharif, M. Mahadi Abdul Jamil, Md. Asri Ngad...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 29 days ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
GIS
2007
ACM
14 years 8 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
ATAL
2008
Springer
13 years 9 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...