463 search results - page 43 / 93 » A General Framework for Graph Sparsification |
148
Voted
CIE
2007
Springer
15 years 9 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
219
Voted
IJCV
2006
15 years 3 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
134
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
152
Voted
WWW
2009
ACM
15 years 10 months ago
2009
ACM
This paper proposes an effective approach to provide relevant search terms for conceptual Web search. ‘Semantic Term Suggestion’ function has been included so that users can f...
132
Voted
ESWS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common d...