1795 search results - page 340 / 359 » On the Complexity of Circuit Satisfiability |
KDD
2003
ACM
14 years 10 months ago
2003
ACM
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
KDD
2001
ACM
14 years 10 months ago
2001
ACM
Web Usage Mining (WUM), a natural application of data mining techniques to the data collected from user interactions with the web, has greatly concerned both academia and industry ...
CHI
2004
ACM
14 years 10 months ago
2004
ACM
This chapter introduces the concept of multi-modal interaction and our findings related to the development of biomedical applications for two different projection modalities: virtu...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...