Sciweavers

1710 search results - page 108 / 342
» Parallelism in Structured Newton Computations
Sort
View
DEDS
2006
119views more  DEDS 2006»
15 years 5 months ago
Diagnosability of Discrete Event Systems with Modular Structure
The diagnosis of unobservable faults in large and complex discrete event systems modeled by parallel composition of automata is considered. A modular approach is developed for diag...
Olivier Contant, Stéphane Lafortune, Demost...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
16 years 7 days ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
ICDCS
2005
IEEE
15 years 11 months ago
Keyword Search in DHT-Based Peer-to-Peer Networks
Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unab...
Yuh-Jzer Joung, Chien-Tse Fang, Li-Wei Yang
TKDE
2002
148views more  TKDE 2002»
15 years 5 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
16 years 6 months ago
Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
Lei Li, Wenjie Fu, Fan Guo, Todd C. Mowry, Christo...