Sciweavers

5128 search results - page 709 / 1026
» When Abstraction Fails
Sort
View
174
Voted
ICALP
2004
Springer
16 years 4 days ago
A Faster Algorithm for Minimum Cycle Basis of Graphs
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
ICCSA
2004
Springer
16 years 4 days ago
A Scheme for Improving WEP Key Transmission between APs in Wireless Environment
Abstract. Wireless LAN (WLAN) refers to the wireless network environment constructed indoors or outdoors, by using either the radio or light wave technology instead of wire signals...
Chi Hyung In, Choong Seon Hong, Il Gyu Song
ICCSA
2004
Springer
16 years 4 days ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
ICGI
2004
Springer
16 years 4 days ago
Identifying Left-Right Deterministic Linear Languages
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
Jorge Calera-Rubio, José Oncina
ICLP
2004
Springer
16 years 4 days ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...