Sciweavers

13336 search results - page 2460 / 2668
» Computer Vision: Algorithms and Applications
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 6 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
CIDR
2003
164views Algorithms» more  CIDR 2003»
15 years 5 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
AAAI
1994
15 years 5 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
ALIFE
2008
15 years 4 months ago
A Model of the Quorum Sensing System in Vibrio fischeri Using P Systems
Quorum sensing is a cell density dependent gene regulation system that allows an entire population of bacterial cells to communicate in order to regulate the expression of certain ...
Francisco José Romero-Campero, Mario J. P&e...
CN
2006
85views more  CN 2006»
15 years 4 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
« Prev « First page 2460 / 2668 Last » Next »