Sciweavers

371 search results - page 66 / 75
» Partition Theorems and Computability Theory
Sort
View
JCC
2007
110views more  JCC 2007»
14 years 9 months ago
Improved grid-based algorithm for Bader charge allocation
: An improvement to the grid-based algorithm of Henkelman et al. for the calculation of Bader volumes is suggested, which more accurately calculates atomic properties as predicted ...
Edward Sanville, Steven D. Kenny, Roger Smith, Gra...
IPL
2002
118views more  IPL 2002»
14 years 9 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot
VIS
2005
IEEE
146views Visualization» more  VIS 2005»
15 years 10 months ago
View Selection for Volume Rendering
In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the...
Udeepta Bordoloi, Han-Wei Shen
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 2 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
JSAC
2008
140views more  JSAC 2008»
14 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham