Sciweavers

2150 search results - page 235 / 430
» On a restricted cross-intersection problem
Sort
View
STACS
2004
Springer
15 years 9 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
VLDB
2004
ACM
124views Database» more  VLDB 2004»
15 years 9 months ago
Containment of Nested XML Queries
Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q if the answer for Q is always a subset of...
Xin Dong, Alon Y. Halevy, Igor Tatarinov
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 9 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
IEEEPACT
2003
IEEE
15 years 9 months ago
Resolving Register Bank Conflicts for a Network Processor
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
Xiaotong Zhuang, Santosh Pande
LCN
2003
IEEE
15 years 9 months ago
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
Jamil A. Shaikh, Julio Solano-González, Iva...