Sciweavers

2609 search results - page 458 / 522
» Models for Global Constraint Applications
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
16 years 4 days ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
15 years 6 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
IEEEPACT
2007
IEEE
15 years 6 months ago
Performance Portable Optimizations for Loops Containing Communication Operations
Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the pro...
Costin Iancu, Wei Chen, Katherine A. Yelick
EKAW
2004
Springer
15 years 5 months ago
Generating and Integrating Evidence for Ontology Mappings
For more than a decade, ontologies have been proposed as a means to enable sharing and reuse of knowledge. While originally relatively narrow information landscapes have been in mi...
Ludger van Elst, Malte Kiesel
ESOP
2003
Springer
15 years 5 months ago
A Tail-Recursive Semantics for Stack Inspections
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
John Clements, Matthias Felleisen