Sciweavers

13214 search results - page 2455 / 2643
» Pseudorandomness for network algorithms
Sort
View
COMPULOG
1999
Springer
15 years 11 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
RTAS
1999
IEEE
15 years 11 months ago
Scalable Scheduling Support for Loss and Delay Constrained Media Streams
Real-time media servers need to service hundreds and, possibly, thousands of clients, each with their own quality of service (QoS) requirements. To guarantee such diverse QoS requ...
Richard West, Karsten Schwan, Christian Poellabaue...
SRDS
1999
IEEE
15 years 11 months ago
An Adaptive Checkpointing Protocol to Bound Recovery Time with Message Logging
Numerous mathematical approaches have been proposed to determine the optimal checkpoint interval for minimizing total execution time of an application in the presence of failures....
Kuo-Feng Ssu, Bin Yao, W. Kent Fuchs
ICVS
1999
Springer
15 years 11 months ago
Ascender II, a Visual Framework for 3D Reconstruction
This paper presents interim results from an ongoing project on aerial image reconstruction. One important task in image interpretation is the process of understanding and identifyi...
Maurício Marengoni, Christopher O. Jaynes, ...
ILP
1999
Springer
15 years 11 months ago
Probabilistic Relational Models
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
Daphne Koller
« Prev « First page 2455 / 2643 Last » Next »