Sciweavers

3758 search results - page 320 / 752
» A Complete Subsumption Algorithm
Sort
View
IRI
2005
IEEE
16 years 7 days ago
Handling missing values via decomposition of the conditioned set
In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly impr...
Mei-Ling Shyu, Indika Kuruppu-Appuhamilage, Shu-Ch...
180
Voted
AMOST
2005
ACM
16 years 6 days ago
Test prioritization for pairwise interaction coverage
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
HIPEAC
2005
Springer
16 years 5 days ago
Exploiting a Computation Reuse Cache to Reduce Energy in Network Processors
Abstract. High end routers are targeted at providing worst case throughput guarantees over latency. Caches on the other hand are meant to help latency not throughput in a tradition...
Bengu Li, Ganesh Venkatesh, Brad Calder, Rajiv Gup...
SIGCOMM
2004
ACM
16 years 2 days ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
16 years 1 days ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...