Sciweavers

105 search results - page 12 / 21
» Algorithmic Proof with Diminishing Resources, Part 1
Sort
View
ECRTS
1999
IEEE
14 years 2 days ago
Handling sporadic tasks in off-line scheduled distributed real-time systems
Many industrial applications mandate the use of a timetriggered paradigm and consequently the use of off-line scheduling for reasons such as predictability, certification, cost, o...
Damir Isovic, Gerhard Fohler
RECSYS
2009
ACM
14 years 2 months ago
Latent dirichlet allocation for tag recommendation
Tagging systems have become major infrastructures on the Web. They allow users to create tags that annotate and categorize content and share them with other users, very helpful in...
Ralf Krestel, Peter Fankhauser, Wolfgang Nejdl
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 8 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
DEXA
2009
Springer
173views Database» more  DEXA 2009»
14 years 2 months ago
Incremental Ontology-Based Extraction and Alignment in Semi-structured Documents
SHIRI 1 is an ontology-based system for integration of semistructured documents related to a specific domain. The system’s purpose is to allow users to access to relevant parts ...
Mouhamadou Thiam, Nacéra Bennacer, Nathalie...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi