Sciweavers

7913 search results - page 87 / 1583
» Information Collection on a Graph
Sort
View
ECAI
2008
Springer
13 years 10 months ago
Partial and Informative Common Subsumers in Description Logics
Least Common Subsumers in Description Logics have shown their usefulness for discovering commonalities among all concepts of a collection. Several applications are nevertheless foc...
Simona Colucci, Eugenio Di Sciascio, Francesco M. ...
IPL
2002
95views more  IPL 2002»
13 years 8 months ago
On a game in directed graphs
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
Alan J. Hoffman, Kate Jenkins, Tim Roughgarden
DOCENG
2009
ACM
14 years 3 months ago
Test collection management and labeling system
In order to evaluate the performance of information retrieval and extraction algorithms, we need test collections. A test collection consists of a set of documents, a clearly form...
Eunyee Koh, Andruid Kerne, Sarah Berry
WWW
2005
ACM
14 years 9 months ago
Information flow using edge stress factor
This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically. A novel algorithm based on the concept of Edge Stress F...
Franco Salvetti, Savitha Srinivasan
OOPSLA
2005
Springer
14 years 2 months ago
Fortune teller: improving garbage collection performance in server environment using live objects prediction
Currently, the most adopted criterion to invoke garbage collection is heap space exhaustion. In other words, garbage collection is invoked when the heap space (either the entire s...
Feng Xian, Witawas Srisa-an, Hong Jiang