Sciweavers

7006 search results - page 1066 / 1402
» Approximation Algorithms
Sort
View
SI3D
1999
ACM
15 years 11 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 6 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
ER
2010
Springer
121views Database» more  ER 2010»
15 years 5 months ago
Reasoning with Optional and Preferred Requirements
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
Neil A. Ernst, John Mylopoulos, Alexander Borgida,...
ATAL
2007
Springer
16 years 27 days ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
GLOBECOM
2010
IEEE
15 years 4 months ago
Relay Station Placement for Cooperative Communications in WiMAX Networks
The recently emerging WiMAX (IEEE 802.16) is a promising telecommunication technology to provide low-cost, high-speed and long-range wireless communications. To meet the growing de...
Dejun Yang, Xi Fang, Guoliang Xue, Jian Tang
« Prev « First page 1066 / 1402 Last » Next »