Sciweavers

1449 search results - page 95 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
CPAIOR
2006
Springer
15 years 10 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 10 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
AAAI
2008
15 years 8 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
NETWORKING
2010
15 years 7 months ago
Bidirectional Range Extension for TCAM-Based Packet Classification
Abstract. Packet classification is a fundamental task for network devices such as edge routers, firewalls, and intrusion detection systems. Currently, most vendors use Ternary Cont...
Yan Sun, Min Sik Kim
OPODIS
2003
15 years 7 months ago
Linear Time Byzantine Self-Stabilizing Clock Synchronization
Awareness of the need for robustness in distributed systems increases as distributed systems become an integral part of day-to-day systems. Tolerating Byzantine faults and possessi...
Ariel Daliot, Danny Dolev, Hanna Parnas