87 search results - page 17 / 18 » Solving large Steiner Triple Covering Problems |
WPES
2003
ACM
14 years 26 days ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
AIPS
2010
13 years 10 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
JAIR
2007
13 years 7 months ago
2007
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
EIS
2011
13 years 2 months ago
2011
Most software engineering techniques that deal with software products customization are based on anticipation: The software designer has to foresee, somehow, the future needs for ...