Sciweavers

2474 search results - page 383 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
137
Voted
ICALP
2009
Springer
16 years 2 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
MDM
2009
Springer
123views Communications» more  MDM 2009»
15 years 8 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
ISAAC
2004
Springer
114views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
RNA is generally a single-stranded molecule where the bases form hydrogen bonds within the same molecule leading to structure formation. In comparing different homologous RNA mole...
Markus Bauer, Gunnar W. Klau
120
Voted
ECCV
2010
Springer
15 years 27 days ago
Element-Wise Factorization for N-View Projective Reconstruction
Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such ...
Yuchao Dai, Hongdong Li, Mingyi He
ICSOC
2010
Springer
15 years 7 days ago
Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy
Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of ser...
Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden