Sciweavers

245 search results - page 35 / 49
» Locating phase transitions in computationally hard problems
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 5 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
GIS
2008
ACM
15 years 24 days ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
99
Voted
ATAL
2003
Springer
15 years 5 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
16 years 16 hour ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
GRAPHICSINTERFACE
2011
14 years 3 months ago
Ubiquitous cursor: a comparison of direct and indirect pointing feedback in multi-display environments
Multi-display environments (MDEs) connect several displays into a single digital workspace. One of the main problems to be solved in an MDE’s design is how to enable movement of...
Robert Xiao, Miguel A. Nacenta, Regan L. Mandryk, ...