Sciweavers

705 search results - page 20 / 141
» Approximating Extended Answer Sets
Sort
View
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
15 years 2 months ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
IEEEICCI
2006
IEEE
15 years 3 months ago
Rough Set Method Based on Multi-Granulations
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...
Y. H. Qian, J. Y. Liang
68
Voted
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
15 years 3 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa
CCCG
1997
14 years 11 months ago
Label placement by maximum independent set in rectangles
Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follow...
Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Su...
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
14 years 9 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin