Sciweavers

2150 search results - page 368 / 430
» On a restricted cross-intersection problem
Sort
View
TELETRAFFIC
2007
Springer
15 years 10 months ago
Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
Saikat Ray, Roch Guérin, Rute Sofia
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
15 years 10 months ago
Autonomous Index Optimization in XML Databases
Abstract— Defining suitable indexes is a major task when optimizing a database. Usually, a human database administrator defines a set of indexes in the design phase of the data...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 10 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
JSSPP
2005
Springer
15 years 10 months ago
An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering
Recently HP Labs engaged in a joint project with DreamWorks Animation to develop a Utility Rendering Service that was used to render part of the computer-animated feature film Shr...
Yunhong Zhou, Terence Kelly, Janet L. Wiener, Eric...
STACS
2005
Springer
15 years 10 months ago
Kolmogorov-Loveland Randomness and Stochasticity
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
Wolfgang Merkle, Joseph S. Miller, André Ni...