Sciweavers

1605 search results - page 321 / 321
» On Partitional Labelings of Graphs
Sort
View
ACTAC
1998
71views more  ACTAC 1998»
13 years 5 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 3 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
AI
2011
Springer
13 years 11 days ago
Approximation of action theories and its application to conformant planning
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...
WWW
2011
ACM
13 years 7 days ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
SPAA
2010
ACM
13 years 10 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...