Sciweavers

3778 search results - page 620 / 756
» Representing Web Graphs
Sort
View
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 3 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
SEMWEB
2005
Springer
14 years 3 months ago
Semantically Rich Recommendations in Social Networks for Sharing, Exchanging and Ranking Semantic Context
Recommender algorithms have been quite successfully employed in a variety of scenarios from filtering applications to recommendations of movies and books at Amazon.com. However, a...
Stefania Ghita, Wolfgang Nejdl, Raluca Paiu
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
14 years 3 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
14 years 3 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
PODC
2004
ACM
14 years 3 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen