Sciweavers

900 search results - page 129 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
SPAA
2003
ACM
14 years 1 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
14 years 7 days ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
13 years 10 months ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel
UIC
2010
Springer
13 years 7 months ago
A Lattice-Theoretic Approach to Runtime Property Detection for Pervasive Context
Abstract. Runtime detection of contextual properties is one of the primary approaches to enabling context-awareness. Existing property detection schemes implicitly assume that cont...
Tingting Hua, Yu Huang 0002, Jiannong Cao, XianPin...
ICRA
2005
IEEE
130views Robotics» more  ICRA 2005»
14 years 2 months ago
Effective Constrained Dynamic Simulation Using Implicit Constraint Enforcement
- Stable and effective enforcement of hard constraints is one of the crucial components in controlling physics-based dynamic simulation systems. The conventional explicit Baumgarte...
Min Hong, Min-Hyung Choi, Sunhwa Jung, Samuel W. J...