1814 search results - page 154 / 363 » Improved Results on Geometric Hitting Set Problems |
166
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
194
click to vote
WEBI
2005
Springer
15 years 12 months ago
2005
Springer
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
160
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
193
click to vote
TSMC
2011
15 years 1 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
148
click to vote
IIS
2004
15 years 7 months ago
2004
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...