Sciweavers

5055 search results - page 638 / 1011
» Relative Timing
Sort
View
EGOV
2009
Springer
16 years 1 months ago
Post Recommendation in Social Web Site
Abstract. Web 2.0 applications attract more and more people to express their opinions on the Web in various ways. However, the explosively increasing information in social web site...
Long Wang 0002, Justus Bross, Christoph Meinel
ESA
2009
Springer
146views Algorithms» more  ESA 2009»
16 years 1 months ago
Kernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
Hans L. Bodlaender, Stéphan Thomassé...
GCB
2009
Springer
180views Biometrics» more  GCB 2009»
16 years 1 months ago
2D Projections of RNA Folding Landscapes
Abstract: The analysis of RNA folding landscapes yields insights into the kinetic folding behavior not available from classical structure prediction methods. This is especially imp...
Ronny Lorenz, Christoph Flamm, Ivo L. Hofacker
ICSOC
2009
Springer
16 years 1 months ago
An Automatic Approach to Enable Replacement of Conversational Services
Abstract. In Service Oriented Architectures (SOAs) services invoked in a composition can be replaced by other services, which are possibly discovered and bound at runtime. Most of ...
Luca Cavallaro, Elisabetta Di Nitto, Matteo Pradel...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Hilbert's Thirteenth Problem and Circuit Complexity
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...