Sciweavers

455 search results - page 38 / 91
» Dynamic well-spaced point sets
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
ATAL
2010
Springer
14 years 11 months ago
Joint process games: from ratings to wikis
We introduce a game setting called a joint process, where the history of actions determine the state, and the state and agent properties determine the payoff. This setting is a sp...
Michael Munie, Yoav Shoham
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
15 years 10 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
IPMI
1999
Springer
15 years 10 months ago
MEG Source Imaging Using Multipolar Expansions
We describe the use of truncated multipolar expansions for producing dynamic images of cortical neural activation from measurements of the magnetoencephalogram. We use a signal-sub...
John C. Mosher, Richard M. Leahy, David W. Shattuc...
DIS
2009
Springer
15 years 4 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han