Sciweavers

77 search results - page 13 / 16
» On expressiveness of the chain graph interpretations
Sort
View
FSTTCS
2009
Springer
16 years 28 days ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
16 years 14 days ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of v...
John E. Hopcroft, Daniel Sheldon
ER
2000
Springer
122views Database» more  ER 2000»
15 years 10 months ago
Managing RDF Metadata for Community Webs
The need for descriptive information, i.e., metadata, about Web resources has been recognized in several application contexts (e.g., digital libraries, portals). The Resource Descr...
Sofia Alexaki, Vassilis Christophides, Gregory Kar...
DEXAW
2005
IEEE
176views Database» more  DEXAW 2005»
15 years 8 months ago
Indexes and Path Constraints in Semistructured Data
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
Yves Andre, Anne-Cécile Caron, Denis Debarb...
JSAC
2006
111views more  JSAC 2006»
15 years 6 months ago
On trust models and trust evaluation metrics for ad hoc networks
Within the realm of network security, we interpret the concept of trust as a relation among entities that participate in various protocols. Trust relations are based on evidence cr...
George Theodorakopoulos, John S. Baras