Sciweavers

477 search results - page 78 / 96
» Complexity Considerations, cSAT Problem Lower Bound
Sort
View
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
14 years 8 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 7 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 7 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
ALT
2002
Springer
14 years 4 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
INFOCOM
2009
IEEE
14 years 2 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec