Sciweavers

92 search results - page 16 / 19
» Towards a Study of Low-Complexity Graphs
Sort
View
SAC
2005
ACM
14 years 1 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
14 years 1 months ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre
SSDBM
2010
IEEE
142views Database» more  SSDBM 2010»
13 years 5 months ago
Efficient and Adaptive Distributed Skyline Computation
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
George Valkanas, Apostolos N. Papadopoulos
SEMWEB
2007
Springer
14 years 1 months ago
Vocabulary Patterns in Free-for-all Collaborative Indexing Systems
In collaborative indexing systems users generate a big amount of metadata by labelling web-based content. These labels are known as tags and form a shared vocabulary. In order to u...
Wolfgang Maass, Tobias Kowatsch, Timo Münster
3DGIS
2006
Springer
14 years 1 months ago
3D Navigation for 3D-GIS - Initial Requirements
The needs for three-dimensional (3D) visualization and navigation within 3D-GIS environment are growing and expanding rapidly in a variety of fields. In a steady shift from tradit...
Ivin Amri Musliman, Alias Abdul-Rahman, Volker Coo...